[INFO] cloning repository https://github.com/simonwater/rust_dsa
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/simonwater/rust_dsa" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsimonwater%2Frust_dsa", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsimonwater%2Frust_dsa'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] ca17f2a6af614eb6be00f442946e343032d087a5
[INFO] testing simonwater/rust_dsa against try#28f95933dc0727396c07b48d0a8cb5211b7fb472 for pr-154065-2
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsimonwater%2Frust_dsa" "/workspace/builds/worker-3-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/simonwater/rust_dsa
[INFO] finished tweaking git repo https://github.com/simonwater/rust_dsa
[INFO] tweaked toml for git repo https://github.com/simonwater/rust_dsa written to /workspace/builds/worker-3-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/simonwater/rust_dsa on toolchain 28f95933dc0727396c07b48d0a8cb5211b7fb472
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/simonwater/rust_dsa already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] a2d540485857246ad5e7b500b80669283034594ea49df4d6394d76d7c6c85343
[INFO] running `Command { std: "docker" "start" "-a" "a2d540485857246ad5e7b500b80669283034594ea49df4d6394d76d7c6c85343", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "a2d540485857246ad5e7b500b80669283034594ea49df4d6394d76d7c6c85343", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a2d540485857246ad5e7b500b80669283034594ea49df4d6394d76d7c6c85343", kill_on_drop: false }`
[INFO] [stdout] a2d540485857246ad5e7b500b80669283034594ea49df4d6394d76d7c6c85343
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 7d4f27030e3d60832a44c27081bd390fbfbfcea4bb55c85bf27854b7cf12c07f
[INFO] running `Command { std: "docker" "start" "-a" "7d4f27030e3d60832a44c27081bd390fbfbfcea4bb55c85bf27854b7cf12c07f", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.186
[INFO] [stderr]    Compiling getrandom v0.2.17
[INFO] [stderr]    Compiling rand_core v0.6.4
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling rand v0.8.6
[INFO] [stderr]    Compiling rust_dsa v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::collections::BinaryHeap`
[INFO] [stdout]  --> src/binary_search/k_closest_elements.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::collections::BinaryHeap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `is_same_tree`
[INFO] [stdout]  --> src/binary_tree/is_same_tree.rs:1:36
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{TreeNode, is_same_tree};
[INFO] [stdout]   |                                    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/binary_tree/is_symmetric.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/binary_tree/level_order/zigzag_level_order.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/binary_tree/width_of_binary_tree.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `Visited` and `Visiting`
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:5:47
[INFO] [stdout]   |
[INFO] [stdout] 5 | use crate::graph::course_schedule_ii::State::{Visited, Visiting};
[INFO] [stdout]   |                                               ^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::DerefMut`
[INFO] [stdout]  --> src/linkedlist/middle_of_the_linked_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::DerefMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `graph::node`
[INFO] [stdout]  --> src/linkedlist/rotate_list.rs:1:13
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::{graph::node, linkedlist::ListNode};
[INFO] [stdout]   |             ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::stack`
[INFO] [stdout]  --> src/stack/asteroid_collision.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::stack;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/longest_consecutive.rs:10:13
[INFO] [stdout]    |
[INFO] [stdout] 10 |         let mut set = nums.into_iter().collect::<HashSet<i32>>();
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/majority_element.rs:10:34
[INFO] [stdout]    |
[INFO] [stdout] 10 |     pub fn majority_element_vote(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                  ----^^^^
[INFO] [stdout]    |                                  |
[INFO] [stdout]    |                                  help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/array/rotate_array.rs:5:40
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]   |                                        ----^
[INFO] [stdout]   |                                        |
[INFO] [stdout]   |                                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/rotate_array.rs:29:40
[INFO] [stdout]    |
[INFO] [stdout] 29 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |                                        ----^
[INFO] [stdout]    |                                        |
[INFO] [stdout]    |                                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |         mut start: usize,
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `version`
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:21:28
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |                            ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_version`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut dummy = Rc::new(RefCell::new(TreeNode::new(0)));
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree/sum_numbers.rs:13:13
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut num = 0;
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:14:32
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ----^^^^^
[INFO] [stdout]    |                                |
[INFO] [stdout]    |                                help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:49:32
[INFO] [stdout]    |
[INFO] [stdout] 49 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ----^^^^^
[INFO] [stdout]    |                                |
[INFO] [stdout]    |                                help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `amount`
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:19
[INFO] [stdout]    |
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                   ^^^^^^ help: if this is intentional, prefix it with an underscore: `_amount`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `coins`
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:32
[INFO] [stdout]    |
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ^^^^^ help: if this is intentional, prefix it with an underscore: `_coins`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/graph/redundant_connection.rs:21:13
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn find(mut val: usize, parents: &mut [usize]) -> usize {
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/graph/update_matrix.rs:59:21
[INFO] [stdout]    |
[INFO] [stdout] 59 |             for (c, val) in row.iter().enumerate() {
[INFO] [stdout]    |                     ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/graph/word_search.rs:5:41
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn exist(board: Vec<Vec<char>>, mut word: String) -> bool {
[INFO] [stdout]   |                                         ----^^^^
[INFO] [stdout]   |                                         |
[INFO] [stdout]   |                                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/hash/happy_number.rs:7:21
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]   |                     ----^
[INFO] [stdout]   |                     |
[INFO] [stdout]   |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/linkedlist/linked_list_cycle.rs:7:22
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn has_cycle(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |                      ----^^^^
[INFO] [stdout]   |                      |
[INFO] [stdout]   |                      help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/linkedlist/linked_list_cycle.rs:29:23
[INFO] [stdout]    |
[INFO] [stdout] 29 |     pub fn has_cycle2(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |                       ----^^^^
[INFO] [stdout]    |                       |
[INFO] [stdout]    |                       help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/linkedlist/odd_even_list.rs:7:26
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn odd_even_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |                          ----^^^^
[INFO] [stdout]   |                          |
[INFO] [stdout]   |                          help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/math/palindrome_number.rs:40:26
[INFO] [stdout]    |
[INFO] [stdout] 40 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]    |                          ----^
[INFO] [stdout]    |                          |
[INFO] [stdout]    |                          help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/container_with_most_water.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area` is never used
[INFO] [stdout]  --> src/array/container_with_most_water.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/contains_duplicate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `contains_duplicate`, `contains_nearby_duplicate`, and `contains_nearby_almost_duplicate` are never used
[INFO] [stdout]   --> src/array/contains_duplicate.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     // set
[INFO] [stdout] 11 |     pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn contains_nearby_almost_duplicate(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/contiguous_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_max_length` is never used
[INFO] [stdout]  --> src/array/contiguous_array.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn find_max_length(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/gas_station.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_complete_circuit` is never used
[INFO] [stdout]  --> src/array/gas_station.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/find_min_arrow_shots.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]  --> src/array/interval/find_min_arrow_shots.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     // 左边界排序
[INFO] [stdout] 6 |     pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/array/interval/find_min_arrow_shots.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]   --> src/array/interval/find_min_arrow_shots.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 30 |     // 右边界排序
[INFO] [stdout] 31 |     pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/insert_interval.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insert` is never used
[INFO] [stdout]  --> src/array/interval/insert_interval.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn insert(intervals: Vec<Vec<i32>>, mut new_interval: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/merge_intervals.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array/interval/merge_intervals.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/non_overlap_intervals.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `erase_overlap_intervals` is never used
[INFO] [stdout]  --> src/array/interval/non_overlap_intervals.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn erase_overlap_intervals(mut intervals: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/summary_ranges.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `summary_ranges` and `to_string` are never used
[INFO] [stdout]   --> src/array/interval/summary_ranges.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn to_string(start: i32, end: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/longest_consecutive.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]  --> src/array/longest_consecutive.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/majority_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `majority_element_sort` and `majority_element_vote` are never used
[INFO] [stdout]   --> src/array/majority_element.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn majority_element_sort(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     pub fn majority_element_vote(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/move_zeroes.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `move_zeroes`, `remove_element`, `remove_duplicates`, and `remove_duplicatesII` are never used
[INFO] [stdout]   --> src/array/move_zeroes.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout]  7 |     pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     pub fn remove_duplicatesII(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/product_except_self.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/array/product_except_self.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/rotate_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rotate` and `reverse` are never used
[INFO] [stdout]   --> src/array/rotate_array.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn reverse(nums: &mut [i32], mut start: usize, mut end: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/array/rotate_array.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]   --> src/array/rotate_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `InsertionSort` is never constructed
[INFO] [stdout]  --> src/array/sort/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct InsertionSort;
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort` is never used
[INFO] [stdout]  --> src/array/sort/insertion_sort.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl InsertionSort {
[INFO] [stdout]   | ------------------ associated function in this implementation
[INFO] [stdout] 4 |     pub fn sort(nums: &mut Vec<i32>) {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sort/kth_largest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_kth_largest` and `qselect` are never used
[INFO] [stdout]   --> src/array/sort/kth_largest.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     // 快速选择
[INFO] [stdout]  7 |     pub fn find_kth_largest(mut nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn qselect(nums: &mut [i32], start: usize, end: usize, k: usize, rng: &mut ThreadRng) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sort/quick_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sort`, `qsort`, and `partition` are never used
[INFO] [stdout]   --> src/array/sort/quick_sort.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     // 快速排序
[INFO] [stdout]  5 |     pub fn sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn qsort(nums: &mut [i32], start: usize, end: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn partition(nums: &mut [i32], start: usize, end: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sort/sort_colors.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort_colors` is never used
[INFO] [stdout]  --> src/array/sort/sort_colors.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn sort_colors(nums: &mut Vec<i32>) {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sorted_squares.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sorted_squares_simple` and `sorted_squares` are never used
[INFO] [stdout]   --> src/array/sorted_squares.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn sorted_squares_simple(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     pub fn sorted_squares(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/stock_max_profit.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array/stock_max_profit.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/subarray_sum_equals_k.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `subarray_sum` is never used
[INFO] [stdout]  --> src/array/subarray_sum_equals_k.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/three_sum.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]  --> src/array/three_sum.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/three_sum_closest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum_closest` is never used
[INFO] [stdout]  --> src/array/three_sum_closest.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn three_sum_closest(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/two_sum.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `two_sum` and `two_sum_ordered` are never used
[INFO] [stdout]   --> src/array/two_sum.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     pub fn two_sum_ordered(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/letter_combinations.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DICT` is never used
[INFO] [stdout]  --> src/backtrack/letter_combinations.rs:7:7
[INFO] [stdout]   |
[INFO] [stdout] 7 | const DICT: &[&[char]; 8] = &[
[INFO] [stdout]   |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 19 |     //
[INFO] [stdout] 20 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn dfs(i: usize, digits: &[usize], path: &mut String, ans: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MAP` is never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:52:7
[INFO] [stdout]    |
[INFO] [stdout] 52 | const MAP: &[&[u8]] = &[
[INFO] [stdout]    |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 56 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 57 |     //
[INFO] [stdout] 58 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn dfs(i: usize, digits: &[usize], path: &mut [u8], ans: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution1` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Solution1;
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution1 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn combination_sum(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 40 |     pub fn combination_sum(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum_ii.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn combination_sum2(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(mut i: usize, target: i32, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 37 |     // 对答案中的每一个位置，都枚举所有可能填入的数字
[INFO] [stdout] 38 |     pub fn combination_sum2(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum_iii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum3` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     //
[INFO] [stdout]  6 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(num: i32, target: i32, k: usize, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum3` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 35 |     //
[INFO] [stdout] 36 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(start: i32, target: i32, pos: usize, path: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combine_n_k.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn dfs(i: i32, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, n: i32, left: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn dfs(start: i32, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, n: i32, left: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/permutations.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, used: &mut Vec<bool>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 35 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn dfs(nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, used_mask: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 59 | impl Solution3 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 60 |     pub fn permute(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn dfs(start: usize, nums: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/permutations_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute_unique` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations_ii.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn permute_unique(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn dfs(start: usize, nums: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/subsets.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(i: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn dfs(start: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/subsets_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets_with_dup` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(start: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets_with_dup` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 30 |     pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn dfs(mut i: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary/add_binary.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_binary` is never used
[INFO] [stdout]  --> src/binary/add_binary.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn add_binary(a: String, b: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary/counting_bits.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_bits` is never used
[INFO] [stdout]  --> src/binary/counting_bits.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn count_bits(n: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary/number_of_1_bits.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `hamming_weight` is never used
[INFO] [stdout]  --> src/binary/number_of_1_bits.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn hamming_weight(mut n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/LIS.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `length_of_lis` and `lower_bound` are never used
[INFO] [stdout]   --> src/binary_search/LIS.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn lower_bound(nums: &[i32], x: i32) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_peak_element` is never used
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/first_bad_version.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `first_bad_version` and `isBadVersion` are never used
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- methods in this implementation
[INFO] [stdout]  5 |     pub fn first_bad_version(&self, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/k_closest_elements.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_closest_elements` is never used
[INFO] [stdout]   --> src/binary_search/k_closest_elements.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 10 |     pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/mountain_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]  --> src/binary_search/mountain_array.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 49 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/rotated_sorted_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search` and `find_min` are never used
[INFO] [stdout]   --> src/binary_search/rotated_sorted_array.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/russian_doll_envelopes.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_envelopes` and `lower_bound` are never used
[INFO] [stdout]   --> src/binary_search/russian_doll_envelopes.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn max_envelopes(mut envelopes: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn lower_bound(nums: &[i32], x: i32) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search`, `search2`, and `search3` are never used
[INFO] [stdout]   --> src/binary_search/search.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn search2(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn search3(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_insert.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/binary_search/search_insert.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_matrix.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix` is never used
[INFO] [stdout]  --> src/binary_search/search_matrix.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_range.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search_range`, `search_bound`, and `search_bound2` are never used
[INFO] [stdout]   --> src/binary_search/search_range.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn search_bound(nums: &[i32], target: i32, is_lower: bool) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     fn search_bound2(nums: &[i32], target: i32, is_lower: bool) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TimeMap` is never constructed
[INFO] [stdout]  --> src/binary_search/time_map.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct TimeMap {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set`, `get`, and `search_upper` are never used
[INFO] [stdout]   --> src/binary_search/time_map.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl TimeMap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn set(&mut self, key: String, value: String, timestamp: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn get(&self, key: String, timestamp: i32) -> String {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn search_upper(values: &[(i32, String)], target_time: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/minimum_difference.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_minimum_difference` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/minimum_difference.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, prev: &mut i32, ans: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/my_calendar_i.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Node {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Node {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 11 |     fn new(start_time: i32, end_time: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCalendar` is never constructed
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct MyCalendar {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `book`, and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl MyCalendar {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 27 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn book(&mut self, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn dfs(node_rc: Rc<RefCell<Node>>, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCalendar2` is never constructed
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:75:8
[INFO] [stdout]    |
[INFO] [stdout] 75 | struct MyCalendar2 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `book` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:80:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | impl MyCalendar2 {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 80 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 84 |     fn book(&mut self, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/search_in_bst.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search_bst` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn search_bst(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, val: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_bst` is never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn search_bst(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/build_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `build_tree` and `build_helper` are never used
[INFO] [stdout]   --> src/binary_tree/build_tree.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn build_helper(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/build_tree.rs:63:8
[INFO] [stdout]    |
[INFO] [stdout] 63 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `build_tree` and `build_helper` are never used
[INFO] [stdout]   --> src/binary_tree/build_tree.rs:65:12
[INFO] [stdout]    |
[INFO] [stdout] 64 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 65 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     pub fn build_helper(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CBTInserter` is never constructed
[INFO] [stdout]  --> src/binary_tree/complete_binary_tree_inserter.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct CBTInserter {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, and `get_root` are never used
[INFO] [stdout]   --> src/binary_tree/complete_binary_tree_inserter.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl CBTInserter {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new(root: Option<Rc<RefCell<TreeNode>>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn insert(&mut self, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     fn get_root(&self) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/count_nodes.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_nodes`, `count_nodes_better`, `get_height`, and `get_height_iter` are never used
[INFO] [stdout]   --> src/binary_tree/count_nodes.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn count_nodes_better(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn get_height(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn get_height_iter(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/diameter_of_binary_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `diameter_of_binary_tree` and `get_height` are never used
[INFO] [stdout]   --> src/binary_tree/diameter_of_binary_tree.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn get_height(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/distance_k_in_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `distance_k` and `init_parents` are never used
[INFO] [stdout]   --> src/binary_tree/distance_k_in_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 11 |     pub fn distance_k(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn init_parents(
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_to_linked_list.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, prev: &mut Rc<RefCell<TreeNode>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 34 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, next: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:56:8
[INFO] [stdout]    |
[INFO] [stdout] 56 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flatten` is never used
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 57 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 58 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution4` is never constructed
[INFO] [stdout]    --> src/binary_tree/flatten_to_linked_list.rs:117:8
[INFO] [stdout]     |
[INFO] [stdout] 117 | struct Solution4;
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flatten` is never used
[INFO] [stdout]    --> src/binary_tree/flatten_to_linked_list.rs:119:12
[INFO] [stdout]     |
[INFO] [stdout] 118 | impl Solution4 {
[INFO] [stdout]     | -------------- associated function in this implementation
[INFO] [stdout] 119 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]  --> src/binary_tree/invert_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_balanced.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_balanced` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/is_balanced.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_same_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]  --> src/binary_tree/is_same_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_same_tree(
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_subtree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_subtree_simple`, `dfs_simple`, `is_subtree`, `dfs`, `is_same_tree`, and `get_depth` are never used
[INFO] [stdout]   --> src/binary_tree/is_subtree.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn is_subtree_simple(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs_simple(
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn is_subtree(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     fn is_same_tree(p: &Option<Rc<RefCell<TreeNode>>>, q: &Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn get_depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_symmetric.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `check` are never used
[INFO] [stdout]   --> src/binary_tree/is_symmetric.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn check(root1: &Option<Rc<RefCell<TreeNode>>>, root2: &Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/average_of_levels.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `average_of_levels` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/average_of_levels.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/find_bottom_left_value.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_bottom_left_value` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/find_bottom_left_value.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     /// 按照先右后左的顺序入队列，最后弹出的节点就是树的左下角节点
[INFO] [stdout] 10 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/level_order/find_bottom_left_value.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_bottom_left_value` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/level_order/find_bottom_left_value.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, depth: i32, max_depth: &mut i32, ans: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution1` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/largest_values.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution1;
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_values` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/largest_values.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution1 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/level_order/largest_values.rs:41:8
[INFO] [stdout]    |
[INFO] [stdout] 41 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `largest_values` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/level_order/largest_values.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 44 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, depth: usize, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/level_order.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/level_order.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/zigzag_level_order.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `zigzag_level_order` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/zigzag_level_order.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/lowest_common_ancestor.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used
[INFO] [stdout]  --> src/binary_tree/lowest_common_ancestor.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn lowest_common_ancestor(
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/max_depth.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]  --> src/binary_tree/max_depth.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/max_path_sum.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_path_sum` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/max_path_sum.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn max_path_sum(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/merge_trees.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_trees` is never used
[INFO] [stdout]  --> src/binary_tree/merge_trees.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn merge_trees(
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/path_sum.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `has_path_sum`, `path_sum`, `dfs`, `path_sum_iii`, and `path_sum_iii_dfs` are never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn path_sum_iii(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn path_sum_iii_dfs(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/populating_next_right_pointers.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `connect` is never used
[INFO] [stdout]  --> src/binary_tree/populating_next_right_pointers.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn connect(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/prune_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `prune_tree` is never used
[INFO] [stdout]  --> src/binary_tree/prune_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn prune_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/right_side_view.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `right_side_view` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/right_side_view.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, depth: usize, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Codec` is never constructed
[INFO] [stdout]  --> src/binary_tree/serialize_and_deserialize.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Codec {}
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `serialize`, `serialize_inner`, `deserialize`, and `deserialize_inner` are never used
[INFO] [stdout]   --> src/binary_tree/serialize_and_deserialize.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Codec {
[INFO] [stdout]    | ---------- associated items in this implementation
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn serialize(&self, root: Option<Rc<RefCell<TreeNode>>>) -> String {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn serialize_inner(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut String) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn deserialize(&self, data: String) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn deserialize_inner(data: &[u8], pos: &mut usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/sum_numbers.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sum_numbers`, `dfs`, `sum_numbers_clean`, and `dfs2` are never used
[INFO] [stdout]   --> src/binary_tree/sum_numbers.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn sum_numbers(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, mut num: i32, ans: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn sum_numbers_clean(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn dfs2(root: Option<Rc<RefCell<TreeNode>>>, mut num: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/traversal.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `preorder_traversal`, `pre_dfs`, `inorder_traversal`, `in_dfs`, `postorder_traversal`, and `post_dfs` are never used
[INFO] [stdout]   --> src/binary_tree/traversal.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn pre_dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn in_dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn post_dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/traversal.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `preorder_traversal`, `inorder_traversal`, and `postorder_traversal` are never used
[INFO] [stdout]    --> src/binary_tree/traversal.rs:62:12
[INFO] [stdout]     |
[INFO] [stdout]  61 | impl Solution2 {
[INFO] [stdout]     | -------------- associated functions in this implementation
[INFO] [stdout]  62 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  83 |     pub fn inorder_traversal(mut root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 101 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/width_of_binary_tree.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `width_of_binary_tree` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 11 |     pub fn width_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution1` is never constructed
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution1;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `width_of_binary_tree` is never used
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:48:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | impl Solution1 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 48 |     pub fn width_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/bag_combine/can_partition.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_partition` is never used
[INFO] [stdout]  --> src/dp/bag_combine/can_partition.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     // 
[INFO] [stdout] 8 |     pub fn can_partition(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `coin_change` is never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     //
[INFO] [stdout] 16 |     pub fn coin_change(mut coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MemoDFS1` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct MemoDFS1;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `change` and `dfs` are never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl MemoDFS1 {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 14 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn dfs(i: usize, nums: &[i32], amount: usize, memo: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `change` is never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 49 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `change` is never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:12
[INFO] [stdout]    |
[INFO] [stdout] 81 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 82 |     /// dp[i],凑成金额i的组合总数。
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MemoDFS2` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:90:8
[INFO] [stdout]    |
[INFO] [stdout] 90 | struct MemoDFS2;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `change` and `dfs` are never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:93:12
[INFO] [stdout]    |
[INFO] [stdout] 92 | impl MemoDFS2 {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 93 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 99 |     fn dfs(start: usize, nums: &[i32], amount: i32, memo: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/permute_sum_iv.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `combination_sum4` is never used
[INFO] [stdout]   --> src/dp/bag_combine/permute_sum_iv.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     // [70. 爬楼梯] 问题的扩展，爬楼梯相当于nums是[1, 2]
[INFO] [stdout] 16 |     pub fn combination_sum4(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_ii.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iii.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iv.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iv.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(k: i32, prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/climb_stairs.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `climb_stairs` is never used
[INFO] [stdout]  --> src/dp/climb_stairs.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/edit_distance.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_distance` is never used
[INFO] [stdout]  --> src/dp/edit_distance.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn min_distance(s1: String, s2: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/interleave_string.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_interleave`, `dfs`, and `dp` are never used
[INFO] [stdout]   --> src/dp/interleave_string.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn is_interleave(s1: String, s2: String, s3: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     pub fn dp(s1: String, s2: String, s3: String) -> bool {
[INFO] [stdout]    |            ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/maximum_subarray.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sub_array` is never used
[INFO] [stdout]  --> src/dp/maximum_subarray.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/dp/maximum_subarray.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sub_array` is never used
[INFO] [stdout]   --> src/dp/maximum_subarray.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/triangle.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_total` is never used
[INFO] [stdout]  --> src/dp/triangle.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn minimum_total(triangle: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/bipartite_graph.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_bipartite` is never used
[INFO] [stdout]  --> src/graph/bipartite_graph.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     // bfs 染色的同时判断是否冲突
[INFO] [stdout] 7 |     pub fn is_bipartite(graph: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_finish` is never used
[INFO] [stdout]  --> src/graph/course_schedule.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_finish` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 40 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 41 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61 |     fn dfs(node: usize, g: &Vec<Vec<usize>>, states: &mut [i32]) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `State` is never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:46:6
[INFO] [stdout]    |
[INFO] [stdout] 46 | enum State {
[INFO] [stdout]    |      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_order` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 52 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn dfs(node: usize, g: &[Vec<usize>], states: &mut [State], ans: &mut Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:93:8
[INFO] [stdout]    |
[INFO] [stdout] 93 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Edge` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:95:8
[INFO] [stdout]    |
[INFO] [stdout] 95 | struct Edge {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `EMPTY_EDGE` is never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:99:7
[INFO] [stdout]    |
[INFO] [stdout] 99 | const EMPTY_EDGE: usize = usize::MAX;
[INFO] [stdout]    |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]    --> src/graph/course_schedule_ii.rs:102:12
[INFO] [stdout]     |
[INFO] [stdout] 101 | impl Solution3 {
[INFO] [stdout]     | -------------- associated function in this implementation
[INFO] [stdout] 102 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/find_cheapest_price.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_cheapest_price` is never used
[INFO] [stdout]  --> src/graph/find_cheapest_price.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn find_cheapest_price(n: i32, flights: Vec<Vec<i32>>, src: i32, dst: i32, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/flood_fill.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flood_fill` and `dfs` are never used
[INFO] [stdout]   --> src/graph/flood_fill.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn flood_fill(image: Vec<Vec<i32>>, sr: i32, sc: i32, color: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(image: &mut Vec<Vec<i32>>, r: i32, c: i32, old_color: i32, new_color: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/flood_fill.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flood_fill` is never used
[INFO] [stdout]   --> src/graph/flood_fill.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 31 |     /// bfs
[INFO] [stdout] 32 |     pub fn flood_fill(image: Vec<Vec<i32>>, sr: i32, sc: i32, color: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/max_area_of_island.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_area_of_island` and `dfs` are never used
[INFO] [stdout]   --> src/graph/max_area_of_island.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn max_area_of_island(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn dfs(grid: &mut Vec<Vec<i32>>, r: i32, c: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/max_area_of_island.rs:37:8
[INFO] [stdout]    |
[INFO] [stdout] 37 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_area_of_island` and `bfs` are never used
[INFO] [stdout]   --> src/graph/max_area_of_island.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 40 |     pub fn max_area_of_island(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn bfs(grid: &mut Vec<Vec<i32>>, r: i32, c: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/min_height_trees.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Edge` is never constructed
[INFO] [stdout]  --> src/graph/min_height_trees.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Edge {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/graph/min_height_trees.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Edge {
[INFO] [stdout]   | --------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn new(to: usize, next: usize) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `EMPTY_EDGE` is never used
[INFO] [stdout]   --> src/graph/min_height_trees.rs:13:7
[INFO] [stdout]    |
[INFO] [stdout] 13 | const EMPTY_EDGE: usize = usize::MAX;
[INFO] [stdout]    |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_height_trees` is never used
[INFO] [stdout]   --> src/graph/min_height_trees.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn find_min_height_trees(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/network_delay_time.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `network_delay_time` is never used
[INFO] [stdout]  --> src/graph/network_delay_time.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn network_delay_time(times: Vec<Vec<i32>>, n: i32, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Edge` is never constructed
[INFO] [stdout]   --> src/graph/network_delay_time.rs:51:8
[INFO] [stdout]    |
[INFO] [stdout] 51 | struct Edge {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `EMPTY_EDGE` is never used
[INFO] [stdout]   --> src/graph/network_delay_time.rs:56:7
[INFO] [stdout]    |
[INFO] [stdout] 56 | const EMPTY_EDGE: usize = usize::MAX;
[INFO] [stdout]    |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/network_delay_time.rs:57:8
[INFO] [stdout]    |
[INFO] [stdout] 57 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `network_delay_time` is never used
[INFO] [stdout]   --> src/graph/network_delay_time.rs:59:12
[INFO] [stdout]    |
[INFO] [stdout] 58 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 59 |     pub fn network_delay_time(times: Vec<Vec<i32>>, n: i32, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/num_islands.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `num_islands` and `dfs` are never used
[INFO] [stdout]   --> src/graph/num_islands.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn dfs(grid: &mut Vec<Vec<char>>, r: i32, c: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/num_islands.rs:37:8
[INFO] [stdout]    |
[INFO] [stdout] 37 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `num_islands` and `bfs` are never used
[INFO] [stdout]   --> src/graph/num_islands.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 40 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn bfs(grid: &mut Vec<Vec<char>>, r: i32, c: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/number_of_provinces.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_circle_num` and `find_id` are never used
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn find_id(mut node: usize, ids: &mut [usize]) -> usize {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_circle_num` and `dfs` are never used
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 42 |     pub fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn dfs(node: usize, is_connected: &[Vec<i32>], visited: &mut [bool]) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/pacific_atlantic.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `pacific_atlantic` and `dfs` are never used
[INFO] [stdout]   --> src/graph/pacific_atlantic.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn pacific_atlantic(heights: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn dfs(r: i32, c: i32, prev: i32, heights: &Vec<Vec<i32>>, visited: &mut Vec<Vec<bool>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/redundant_connection.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_redundant_connection` and `find` are never used
[INFO] [stdout]   --> src/graph/redundant_connection.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn find_redundant_connection(edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn find(mut val: usize, parents: &mut [usize]) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/rotting_oranges.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `oranges_rotting` is never used
[INFO] [stdout]  --> src/graph/rotting_oranges.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 7 |     pub fn oranges_rotting(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/shortest_path_binary_matrix.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `D` is never used
[INFO] [stdout]  --> src/graph/shortest_path_binary_matrix.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | const D: [(i32, i32); 8] = [
[INFO] [stdout]   |       ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `shortest_path_binary_matrix` is never used
[INFO] [stdout]   --> src/graph/shortest_path_binary_matrix.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     // bfs层序遍历
[INFO] [stdout] 18 |     pub fn shortest_path_binary_matrix(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `solve` and `dfs` are never used
[INFO] [stdout]   --> src/graph/surrounded_regions.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn solve(board: &mut Vec<Vec<char>>) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn dfs(board: &mut Vec<Vec<char>>, r: i32, c: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/update_matrix.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `update_matrix` and `bfs` are never used
[INFO] [stdout]   --> src/graph/update_matrix.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn update_matrix(mat: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn bfs(mat: &Vec<Vec<i32>>, r: usize, c: usize) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/update_matrix.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `update_matrix` is never used
[INFO] [stdout]   --> src/graph/update_matrix.rs:54:12
[INFO] [stdout]    |
[INFO] [stdout] 53 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 54 |     pub fn update_matrix(mat: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/word_search.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `exist` and `dfs` are never used
[INFO] [stdout]   --> src/graph/word_search.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn exist(board: Vec<Vec<char>>, mut word: String) -> bool {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/first_missing_positive.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `first_missing_positive` and `first_missing_positive2` are never used
[INFO] [stdout]   --> src/hash/first_missing_positive.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn first_missing_positive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     pub fn first_missing_positive2(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/happy_number.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_happy`, `is_happy2`, `is_happy3`, and `new_num` are never used
[INFO] [stdout]   --> src/hash/happy_number.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     /// 哈希表记录已经处理过的数
[INFO] [stdout]  7 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn is_happy2(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn is_happy3(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn new_num(mut n: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/is_anagram.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]  --> src/hash/is_anagram.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     /// 使用栈上固定大小的数组记录字符频次，相比堆上哈希表性能高很多。
[INFO] [stdout] 6 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/isomorphic_strings.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]  --> src/hash/isomorphic_strings.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn is_isomorphic(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RandomizedSet` is never constructed
[INFO] [stdout]  --> src/hash/randomized_set.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct RandomizedSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stdout]   --> src/hash/randomized_set.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl RandomizedSet {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 11 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn get_random(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/ransom_note.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_construct1`, `can_construct2`, and `can_construct3` are never used
[INFO] [stdout]   --> src/hash/ransom_note.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn can_construct1(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn can_construct2(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     pub fn can_construct3(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/word_pattern.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_pattern` is never used
[INFO] [stdout]  --> src/hash/word_pattern.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 9 |     pub fn word_pattern(pattern: String, s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/k_closest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `k_closest`, `k_closest2`, and `k_closest3` are never used
[INFO] [stdout]   --> src/heap/k_closest.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn k_closest2(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn k_closest3(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/k_closest_elements.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_closest_elements` and `find_closest_elements2` are never used
[INFO] [stdout]   --> src/heap/k_closest_elements.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn find_closest_elements2(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/kth_largest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_kth_largest` is never used
[INFO] [stdout]  --> src/heap/kth_largest.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     // 小顶堆
[INFO] [stdout] 9 |     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/top_k_frequent_word.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `WordItem` is never constructed
[INFO] [stdout]  --> src/heap/top_k_frequent_word.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct WordItem {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `top_k_frequent` is never used
[INFO] [stdout]   --> src/heap/top_k_frequent_word.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn top_k_frequent(words: Vec<String>, k: i32) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/add_two_numbers.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `add_two_numbers`, `add_two`, `add_two_numbers_iter`, and `add_two_numbers_bigendian` are never used
[INFO] [stdout]   --> src/linkedlist/add_two_numbers.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn add_two(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn add_two_numbers_iter(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn add_two_numbers_bigendian(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/insertion_sort_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insertion_sort_list` is never used
[INFO] [stdout]  --> src/linkedlist/insertion_sort_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn insertion_sort_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/linkedlist/insertion_sort_list.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insertion_sort_list` is never used
[INFO] [stdout]   --> src/linkedlist/insertion_sort_list.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn insertion_sort_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/linked_list_cycle.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `has_cycle` and `has_cycle2` are never used
[INFO] [stdout]   --> src/linkedlist/linked_list_cycle.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn has_cycle(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn has_cycle2(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LRUCache` is never constructed
[INFO] [stdout]  --> src/linkedlist/lru_cache.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct LRUCache {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/linkedlist/lru_cache.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get`, `put`, `append_to_head`, `remove_node`, and `move_to_head` are never used
[INFO] [stdout]   --> src/linkedlist/lru_cache.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl LRUCache {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 18 |     pub fn new(cap: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn append_to_head(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79 |     fn remove_node(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86 |     fn move_to_head(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/merge_k_lists.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge_k_lists`, `merge`, and `merge_two_lists` are never used
[INFO] [stdout]   --> src/linkedlist/merge_k_lists.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn merge_k_lists(mut lists: Vec<Option<Box<ListNode>>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn merge(lists: &mut [Option<Box<ListNode>>]) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn merge_two_lists(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/merge_two_sorted_lists.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge_two_lists`, `merge_two_lists_iter`, and `merge_two_lists_iter1` are never used
[INFO] [stdout]   --> src/linkedlist/merge_two_sorted_lists.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn merge_two_lists_iter(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn merge_two_lists_iter1(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/middle_of_the_linked_list.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `middle_node` is never used
[INFO] [stdout]  --> src/linkedlist/middle_of_the_linked_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn middle_node(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/odd_even_list.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `odd_even_list` is never used
[INFO] [stdout]  --> src/linkedlist/odd_even_list.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn odd_even_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/palindrome_linked_list.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/linkedlist/palindrome_linked_list.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn is_palindrome(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/partition_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `partition` is never used
[INFO] [stdout]  --> src/linkedlist/partition_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn partition(head: Option<Box<ListNode>>, x: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/remove_nth_from_end.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]  --> src/linkedlist/remove_nth_from_end.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/reorder_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reorder_list` is never used
[INFO] [stdout]  --> src/linkedlist/reorder_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn reorder_list(head: &mut Option<Box<ListNode>>) {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/reverse_k_group.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_k_group` and `reverse_list` are never used
[INFO] [stdout]   --> src/linkedlist/reverse_k_group.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn reverse_k_group(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn reverse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/reverse_linked_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_between`, `reverse_list`, `reverse_list_recursive`, and `recursive` are never used
[INFO] [stdout]   --> src/linkedlist/reverse_linked_list.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     /// [92. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/description/)
[INFO] [stdout]  7 |     pub fn reverse_between(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     pub fn reverse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     pub fn reverse_list_recursive(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn recursive(prev: Option<Box<ListNode>>, cur: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/rotate_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rotate_right` and `node_count` are never used
[INFO] [stdout]   --> src/linkedlist/rotate_list.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn rotate_right(mut head: Option<Box<ListNode>>, mut k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn node_count(head: &Option<Box<ListNode>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/sort_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sort_list` and `merge` are never used
[INFO] [stdout]   --> src/linkedlist/sort_list.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn sort_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn merge(
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/swap_pairs.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `swap_pairs` is never used
[INFO] [stdout]  --> src/linkedlist/swap_pairs.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/find_duplicate.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_duplicate` is never used
[INFO] [stdout]  --> src/math/find_duplicate.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     // 环状链表寻找环入口
[INFO] [stdout] 8 |     pub fn find_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/palindrome_number.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/math/palindrome_number.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/math/palindrome_number.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]   --> src/math/palindrome_number.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/math/palindrome_number.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]   --> src/math/palindrome_number.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 40 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/power_of_two.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_two` is never used
[INFO] [stdout]  --> src/math/power_of_two.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn is_power_of_two(mut n: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/math/power_of_two.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_two` is never used
[INFO] [stdout]   --> src/math/power_of_two.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/task_scheduler.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `least_interval` is never used
[INFO] [stdout]  --> src/math/task_scheduler.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn least_interval(tasks: Vec<char>, n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/ugly_number.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `nth_ugly_number` is never used
[INFO] [stdout]  --> src/math/ugly_number.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn nth_ugly_number(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/asteroid_collision.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `asteroid_collision` is never used
[INFO] [stdout]  --> src/stack/asteroid_collision.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn asteroid_collision(asteroids: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/backspace_compare.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `backspace_compare` and `clean_datas` are never used
[INFO] [stdout]   --> src/stack/backspace_compare.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 12 |     fn clean_datas(datas: &[u8]) -> Vec<u8> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/stack/backspace_compare.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `backspace_compare` and `back_scan` are never used
[INFO] [stdout]   --> src/stack/backspace_compare.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn back_scan(bytes: &[u8], mut pos: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/basic_calculator.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `calculate`, `calc`, and `priority` are never used
[INFO] [stdout]   --> src/stack/basic_calculator.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn calculate(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     fn calc(ops: &mut Vec<u8>, nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn priority(op: u8) -> (i32, i32) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/daily_temperatures.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `daily_temperatures` is never used
[INFO] [stdout]  --> src/stack/daily_temperatures.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/decode_string.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `decode_string` is never used
[INFO] [stdout]  --> src/stack/decode_string.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn decode_string(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/eval_rpn.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `eval_rpn` is never used
[INFO] [stdout]  --> src/stack/eval_rpn.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/stack/min_stack.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/stack/min_stack.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout]  7 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyQueue` is never constructed
[INFO] [stdout]  --> src/stack/my_queue.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct MyQueue {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used
[INFO] [stdout]   --> src/stack/my_queue.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl MyQueue {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout]  8 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn peek(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid` and `is_valid2` are never used
[INFO] [stdout]   --> src/stack/valid_parentheses.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn is_valid2(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/character_replacement.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `character_replacement` and `check` are never used
[INFO] [stdout]   --> src/string/character_replacement.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn character_replacement(s: String, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn check(cnt: &[i32; 26], k: i32, total: i32) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/find_anagrams.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_anagrams` is never used
[INFO] [stdout]  --> src/string/find_anagrams.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn find_anagrams(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/group_anagrams.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]  --> src/string/group_anagrams.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/string/group_anagrams.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]   --> src/string/group_anagrams.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/length_of_longest_substring.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `length_of_longest_substring` and `length_of_longest_substring2` are never used
[INFO] [stdout]   --> src/string/length_of_longest_substring.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     /// 通过哈希表记录是否已经存在，如果存在，需要从左边界开始一个一个的迭代删除。
[INFO] [stdout]  7 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn length_of_longest_substring2(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/longest_common_prefix.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/string/longest_common_prefix.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn longest_common_prefix(mut strs: Vec<String>) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/min_window.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_window`, `contains`, and `min_window2` are never used
[INFO] [stdout]   --> src/string/min_window.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     // 对比两个哈希中的每一项来判断是否覆盖
[INFO] [stdout]  6 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn contains(s: &[i32; 60], t: &[i32; 60]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61 |     pub fn min_window2(s: String, t: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/is_palindrome.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_palindrome` and `is_palindrome_iter` are never used
[INFO] [stdout]   --> src/string/palindrome/is_palindrome.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn is_palindrome_iter(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/longest_palindrome.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_palindrome`, `longest_palindrome_substring`, and `check_palindrome` are never used
[INFO] [stdout]   --> src/string/palindrome/longest_palindrome.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn longest_palindrome(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn longest_palindrome_substring(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn check_palindrome(s: &[u8], mut left: usize, mut right: usize) -> (usize, usize, usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/palindromic_substrings.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_substrings`, `count_substrings2`, and `calc` are never used
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     /// 中心扩散法
[INFO] [stdout]  6 |     pub fn count_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     pub fn count_substrings2(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn calc(s_bytes: &[u8], mut i: usize, mut j: usize) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:41:8
[INFO] [stdout]    |
[INFO] [stdout] 41 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_substrings` is never used
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 44 |     pub fn count_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/valid_palindrome.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `valid_palindrome` and `is_palindrome` are never used
[INFO] [stdout]   --> src/string/palindrome/valid_palindrome.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn valid_palindrome(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn is_palindrome(s: &[u8]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/trie/word_break.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_break` is never used
[INFO] [stdout]  --> src/trie/word_break.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/trie/word_break.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_break` is never used
[INFO] [stdout]   --> src/trie/word_break.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `remove_duplicatesII` should have a snake case name
[INFO] [stdout]   --> src/array/move_zeroes.rs:47:12
[INFO] [stdout]    |
[INFO] [stdout] 47 |     pub fn remove_duplicatesII(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `remove_duplicates_ii`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `LIS` should have a snake case name
[INFO] [stdout]  --> src/binary_search/mod.rs:1:9
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub mod LIS;
[INFO] [stdout]   |         ^^^ help: convert the identifier to snake case: `lis`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `isBadVersion` should have a snake case name
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^ help: convert the identifier to snake case: `is_bad_version`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:25:15
[INFO] [stdout]    |
[INFO] [stdout] 25 |         while i >= 0 && j < s_bytes.len() {
[INFO] [stdout]    |               ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 4.63s
[INFO] running `Command { std: "docker" "inspect" "7d4f27030e3d60832a44c27081bd390fbfbfcea4bb55c85bf27854b7cf12c07f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "7d4f27030e3d60832a44c27081bd390fbfbfcea4bb55c85bf27854b7cf12c07f", kill_on_drop: false }`
[INFO] [stdout] 7d4f27030e3d60832a44c27081bd390fbfbfcea4bb55c85bf27854b7cf12c07f
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] c01c7e3ed98b38d8394a5e5a55c51bfb28406da9d46a4000702f3e8431869bdf
[INFO] running `Command { std: "docker" "start" "-a" "c01c7e3ed98b38d8394a5e5a55c51bfb28406da9d46a4000702f3e8431869bdf", kill_on_drop: false }`
[INFO] [stdout] warning: unused import: `std::collections::BinaryHeap`
[INFO] [stdout]  --> src/binary_search/k_closest_elements.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::collections::BinaryHeap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `is_same_tree`
[INFO] [stdout]  --> src/binary_tree/is_same_tree.rs:1:36
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{TreeNode, is_same_tree};
[INFO] [stdout]   |                                    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/binary_tree/is_symmetric.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/binary_tree/level_order/zigzag_level_order.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/binary_tree/width_of_binary_tree.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `Visited` and `Visiting`
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:5:47
[INFO] [stdout]   |
[INFO] [stdout] 5 | use crate::graph::course_schedule_ii::State::{Visited, Visiting};
[INFO] [stdout]   |                                               ^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::DerefMut`
[INFO] [stdout]  --> src/linkedlist/middle_of_the_linked_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::DerefMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `graph::node`
[INFO] [stdout]  --> src/linkedlist/rotate_list.rs:1:13
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::{graph::node, linkedlist::ListNode};
[INFO] [stdout]   |             ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::stack`
[INFO] [stdout]  --> src/stack/asteroid_collision.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::stack;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/longest_consecutive.rs:10:13
[INFO] [stdout]    |
[INFO] [stdout] 10 |         let mut set = nums.into_iter().collect::<HashSet<i32>>();
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/majority_element.rs:10:34
[INFO] [stdout]    |
[INFO] [stdout] 10 |     pub fn majority_element_vote(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                  ----^^^^
[INFO] [stdout]    |                                  |
[INFO] [stdout]    |                                  help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/array/rotate_array.rs:5:40
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]   |                                        ----^
[INFO] [stdout]   |                                        |
[INFO] [stdout]   |                                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/rotate_array.rs:29:40
[INFO] [stdout]    |
[INFO] [stdout] 29 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |                                        ----^
[INFO] [stdout]    |                                        |
[INFO] [stdout]    |                                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |         mut start: usize,
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `version`
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:21:28
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |                            ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_version`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut dummy = Rc::new(RefCell::new(TreeNode::new(0)));
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree/sum_numbers.rs:13:13
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut num = 0;
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:14:32
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ----^^^^^
[INFO] [stdout]    |                                |
[INFO] [stdout]    |                                help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:49:32
[INFO] [stdout]    |
[INFO] [stdout] 49 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ----^^^^^
[INFO] [stdout]    |                                |
[INFO] [stdout]    |                                help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `amount`
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:19
[INFO] [stdout]    |
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                   ^^^^^^ help: if this is intentional, prefix it with an underscore: `_amount`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `coins`
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:32
[INFO] [stdout]    |
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ^^^^^ help: if this is intentional, prefix it with an underscore: `_coins`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/graph/redundant_connection.rs:21:13
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn find(mut val: usize, parents: &mut [usize]) -> usize {
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/graph/update_matrix.rs:59:21
[INFO] [stdout]    |
[INFO] [stdout] 59 |             for (c, val) in row.iter().enumerate() {
[INFO] [stdout]    |                     ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/graph/word_search.rs:5:41
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn exist(board: Vec<Vec<char>>, mut word: String) -> bool {
[INFO] [stdout]   |                                         ----^^^^
[INFO] [stdout]   |                                         |
[INFO] [stdout]   |                                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/hash/happy_number.rs:7:21
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]   |                     ----^
[INFO] [stdout]   |                     |
[INFO] [stdout]   |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/linkedlist/linked_list_cycle.rs:7:22
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn has_cycle(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |                      ----^^^^
[INFO] [stdout]   |                      |
[INFO] [stdout]   |                      help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/linkedlist/linked_list_cycle.rs:29:23
[INFO] [stdout]    |
[INFO] [stdout] 29 |     pub fn has_cycle2(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |                       ----^^^^
[INFO] [stdout]    |                       |
[INFO] [stdout]    |                       help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/linkedlist/odd_even_list.rs:7:26
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn odd_even_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |                          ----^^^^
[INFO] [stdout]   |                          |
[INFO] [stdout]   |                          help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/math/palindrome_number.rs:40:26
[INFO] [stdout]    |
[INFO] [stdout] 40 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]    |                          ----^
[INFO] [stdout]    |                          |
[INFO] [stdout]    |                          help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/container_with_most_water.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area` is never used
[INFO] [stdout]  --> src/array/container_with_most_water.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/contains_duplicate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `contains_duplicate`, `contains_nearby_duplicate`, and `contains_nearby_almost_duplicate` are never used
[INFO] [stdout]   --> src/array/contains_duplicate.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     // set
[INFO] [stdout] 11 |     pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn contains_nearby_almost_duplicate(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/contiguous_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_max_length` is never used
[INFO] [stdout]  --> src/array/contiguous_array.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn find_max_length(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/gas_station.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_complete_circuit` is never used
[INFO] [stdout]  --> src/array/gas_station.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/find_min_arrow_shots.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]  --> src/array/interval/find_min_arrow_shots.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     // 左边界排序
[INFO] [stdout] 6 |     pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/array/interval/find_min_arrow_shots.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]   --> src/array/interval/find_min_arrow_shots.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 30 |     // 右边界排序
[INFO] [stdout] 31 |     pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/insert_interval.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insert` is never used
[INFO] [stdout]  --> src/array/interval/insert_interval.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn insert(intervals: Vec<Vec<i32>>, mut new_interval: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/merge_intervals.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/array/interval/merge_intervals.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/non_overlap_intervals.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `erase_overlap_intervals` is never used
[INFO] [stdout]  --> src/array/interval/non_overlap_intervals.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn erase_overlap_intervals(mut intervals: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/summary_ranges.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `summary_ranges` and `to_string` are never used
[INFO] [stdout]   --> src/array/interval/summary_ranges.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn to_string(start: i32, end: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/longest_consecutive.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]  --> src/array/longest_consecutive.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/majority_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `majority_element_sort` and `majority_element_vote` are never used
[INFO] [stdout]   --> src/array/majority_element.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn majority_element_sort(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     pub fn majority_element_vote(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/move_zeroes.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `move_zeroes`, `remove_element`, `remove_duplicates`, and `remove_duplicatesII` are never used
[INFO] [stdout]   --> src/array/move_zeroes.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout]  7 |     pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     pub fn remove_duplicatesII(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/product_except_self.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/array/product_except_self.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/rotate_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rotate` and `reverse` are never used
[INFO] [stdout]   --> src/array/rotate_array.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn reverse(nums: &mut [i32], mut start: usize, mut end: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/array/rotate_array.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]   --> src/array/rotate_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `InsertionSort` is never constructed
[INFO] [stdout]  --> src/array/sort/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct InsertionSort;
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort` is never used
[INFO] [stdout]  --> src/array/sort/insertion_sort.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl InsertionSort {
[INFO] [stdout]   | ------------------ associated function in this implementation
[INFO] [stdout] 4 |     pub fn sort(nums: &mut Vec<i32>) {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sort/kth_largest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_kth_largest` and `qselect` are never used
[INFO] [stdout]   --> src/array/sort/kth_largest.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     // 快速选择
[INFO] [stdout]  7 |     pub fn find_kth_largest(mut nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn qselect(nums: &mut [i32], start: usize, end: usize, k: usize, rng: &mut ThreadRng) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sort/quick_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sort`, `qsort`, and `partition` are never used
[INFO] [stdout]   --> src/array/sort/quick_sort.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     // 快速排序
[INFO] [stdout]  5 |     pub fn sort(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn qsort(nums: &mut [i32], start: usize, end: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn partition(nums: &mut [i32], start: usize, end: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sort/sort_colors.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort_colors` is never used
[INFO] [stdout]  --> src/array/sort/sort_colors.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn sort_colors(nums: &mut Vec<i32>) {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sorted_squares.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sorted_squares_simple` and `sorted_squares` are never used
[INFO] [stdout]   --> src/array/sorted_squares.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn sorted_squares_simple(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     pub fn sorted_squares(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/stock_max_profit.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/array/stock_max_profit.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/subarray_sum_equals_k.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `subarray_sum` is never used
[INFO] [stdout]  --> src/array/subarray_sum_equals_k.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/three_sum.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]  --> src/array/three_sum.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/three_sum_closest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum_closest` is never used
[INFO] [stdout]  --> src/array/three_sum_closest.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn three_sum_closest(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/two_sum.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `two_sum` and `two_sum_ordered` are never used
[INFO] [stdout]   --> src/array/two_sum.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     pub fn two_sum_ordered(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/letter_combinations.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DICT` is never used
[INFO] [stdout]  --> src/backtrack/letter_combinations.rs:7:7
[INFO] [stdout]   |
[INFO] [stdout] 7 | const DICT: &[&[char]; 8] = &[
[INFO] [stdout]   |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 19 |     //
[INFO] [stdout] 20 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn dfs(i: usize, digits: &[usize], path: &mut String, ans: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MAP` is never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:52:7
[INFO] [stdout]    |
[INFO] [stdout] 52 | const MAP: &[&[u8]] = &[
[INFO] [stdout]    |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 56 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 57 |     //
[INFO] [stdout] 58 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn dfs(i: usize, digits: &[usize], path: &mut [u8], ans: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution1` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct Solution1;
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution1 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn combination_sum(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 40 |     pub fn combination_sum(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum_ii.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn combination_sum2(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(mut i: usize, target: i32, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 37 |     // 对答案中的每一个位置，都枚举所有可能填入的数字
[INFO] [stdout] 38 |     pub fn combination_sum2(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum_iii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum3` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     //
[INFO] [stdout]  6 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(num: i32, target: i32, k: usize, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum3` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 35 |     //
[INFO] [stdout] 36 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(start: i32, target: i32, pos: usize, path: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combine_n_k.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn dfs(i: i32, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, n: i32, left: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn dfs(start: i32, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, n: i32, left: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/permutations.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, used: &mut Vec<bool>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 35 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn dfs(nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, used_mask: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 59 | impl Solution3 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 60 |     pub fn permute(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn dfs(start: usize, nums: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/permutations_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute_unique` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations_ii.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn permute_unique(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn dfs(start: usize, nums: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/subsets.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(i: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn dfs(start: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/subsets_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets_with_dup` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(start: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets_with_dup` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 30 |     pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn dfs(mut i: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary/add_binary.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_binary` is never used
[INFO] [stdout]  --> src/binary/add_binary.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn add_binary(a: String, b: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary/counting_bits.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_bits` is never used
[INFO] [stdout]  --> src/binary/counting_bits.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn count_bits(n: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary/number_of_1_bits.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `hamming_weight` is never used
[INFO] [stdout]  --> src/binary/number_of_1_bits.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn hamming_weight(mut n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/LIS.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `length_of_lis` and `lower_bound` are never used
[INFO] [stdout]   --> src/binary_search/LIS.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn lower_bound(nums: &[i32], x: i32) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_peak_element` is never used
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/first_bad_version.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `first_bad_version` and `isBadVersion` are never used
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- methods in this implementation
[INFO] [stdout]  5 |     pub fn first_bad_version(&self, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/k_closest_elements.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_closest_elements` is never used
[INFO] [stdout]   --> src/binary_search/k_closest_elements.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 10 |     pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/mountain_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]  --> src/binary_search/mountain_array.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 49 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/rotated_sorted_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search` and `find_min` are never used
[INFO] [stdout]   --> src/binary_search/rotated_sorted_array.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/russian_doll_envelopes.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_envelopes` and `lower_bound` are never used
[INFO] [stdout]   --> src/binary_search/russian_doll_envelopes.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn max_envelopes(mut envelopes: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn lower_bound(nums: &[i32], x: i32) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search`, `search2`, and `search3` are never used
[INFO] [stdout]   --> src/binary_search/search.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     pub fn search2(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn search3(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_insert.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/binary_search/search_insert.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_matrix.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix` is never used
[INFO] [stdout]  --> src/binary_search/search_matrix.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_range.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search_range`, `search_bound`, and `search_bound2` are never used
[INFO] [stdout]   --> src/binary_search/search_range.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn search_bound(nums: &[i32], target: i32, is_lower: bool) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     fn search_bound2(nums: &[i32], target: i32, is_lower: bool) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TimeMap` is never constructed
[INFO] [stdout]  --> src/binary_search/time_map.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct TimeMap {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set`, `get`, and `search_upper` are never used
[INFO] [stdout]   --> src/binary_search/time_map.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl TimeMap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn set(&mut self, key: String, value: String, timestamp: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn get(&self, key: String, timestamp: i32) -> String {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn search_upper(values: &[(i32, String)], target_time: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/minimum_difference.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_minimum_difference` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/minimum_difference.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, prev: &mut i32, ans: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/my_calendar_i.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Node {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Node {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 11 |     fn new(start_time: i32, end_time: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCalendar` is never constructed
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct MyCalendar {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `book`, and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl MyCalendar {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 27 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn book(&mut self, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn dfs(node_rc: Rc<RefCell<Node>>, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCalendar2` is never constructed
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:75:8
[INFO] [stdout]    |
[INFO] [stdout] 75 | struct MyCalendar2 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `book` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:80:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | impl MyCalendar2 {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 80 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 84 |     fn book(&mut self, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/search_in_bst.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search_bst` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn search_bst(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, val: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_bst` is never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn search_bst(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/build_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `build_tree` and `build_helper` are never used
[INFO] [stdout]   --> src/binary_tree/build_tree.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn build_helper(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/build_tree.rs:63:8
[INFO] [stdout]    |
[INFO] [stdout] 63 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `build_tree` and `build_helper` are never used
[INFO] [stdout]   --> src/binary_tree/build_tree.rs:65:12
[INFO] [stdout]    |
[INFO] [stdout] 64 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 65 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74 |     pub fn build_helper(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CBTInserter` is never constructed
[INFO] [stdout]  --> src/binary_tree/complete_binary_tree_inserter.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct CBTInserter {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, and `get_root` are never used
[INFO] [stdout]   --> src/binary_tree/complete_binary_tree_inserter.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl CBTInserter {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new(root: Option<Rc<RefCell<TreeNode>>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn insert(&mut self, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     fn get_root(&self) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/count_nodes.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_nodes`, `count_nodes_better`, `get_height`, and `get_height_iter` are never used
[INFO] [stdout]   --> src/binary_tree/count_nodes.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn count_nodes_better(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn get_height(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     fn get_height_iter(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/diameter_of_binary_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `diameter_of_binary_tree` and `get_height` are never used
[INFO] [stdout]   --> src/binary_tree/diameter_of_binary_tree.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn get_height(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/distance_k_in_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `distance_k` and `init_parents` are never used
[INFO] [stdout]   --> src/binary_tree/distance_k_in_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 11 |     pub fn distance_k(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn init_parents(
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/flatten_to_linked_list.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, prev: &mut Rc<RefCell<TreeNode>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 34 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, next: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:56:8
[INFO] [stdout]    |
[INFO] [stdout] 56 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flatten` is never used
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 57 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 58 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution4` is never constructed
[INFO] [stdout]    --> src/binary_tree/flatten_to_linked_list.rs:117:8
[INFO] [stdout]     |
[INFO] [stdout] 117 | struct Solution4;
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flatten` is never used
[INFO] [stdout]    --> src/binary_tree/flatten_to_linked_list.rs:119:12
[INFO] [stdout]     |
[INFO] [stdout] 118 | impl Solution4 {
[INFO] [stdout]     | -------------- associated function in this implementation
[INFO] [stdout] 119 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/invert_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]  --> src/binary_tree/invert_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_balanced.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_balanced` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/is_balanced.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_same_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]  --> src/binary_tree/is_same_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_same_tree(
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_subtree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_subtree_simple`, `dfs_simple`, `is_subtree`, `dfs`, `is_same_tree`, and `get_depth` are never used
[INFO] [stdout]   --> src/binary_tree/is_subtree.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn is_subtree_simple(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs_simple(
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn is_subtree(
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     fn is_same_tree(p: &Option<Rc<RefCell<TreeNode>>>, q: &Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn get_depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/is_symmetric.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_symmetric` and `check` are never used
[INFO] [stdout]   --> src/binary_tree/is_symmetric.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn check(root1: &Option<Rc<RefCell<TreeNode>>>, root2: &Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/average_of_levels.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `average_of_levels` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/average_of_levels.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/find_bottom_left_value.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_bottom_left_value` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/find_bottom_left_value.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     /// 按照先右后左的顺序入队列，最后弹出的节点就是树的左下角节点
[INFO] [stdout] 10 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/level_order/find_bottom_left_value.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_bottom_left_value` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/level_order/find_bottom_left_value.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 37 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, depth: i32, max_depth: &mut i32, ans: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution1` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/largest_values.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution1;
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_values` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/largest_values.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution1 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/level_order/largest_values.rs:41:8
[INFO] [stdout]    |
[INFO] [stdout] 41 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `largest_values` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/level_order/largest_values.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 44 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, depth: usize, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/level_order.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/level_order.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/level_order/zigzag_level_order.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `zigzag_level_order` is never used
[INFO] [stdout]   --> src/binary_tree/level_order/zigzag_level_order.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/lowest_common_ancestor.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used
[INFO] [stdout]  --> src/binary_tree/lowest_common_ancestor.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn lowest_common_ancestor(
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/max_depth.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]  --> src/binary_tree/max_depth.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/max_path_sum.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_path_sum` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/max_path_sum.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn max_path_sum(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/merge_trees.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_trees` is never used
[INFO] [stdout]  --> src/binary_tree/merge_trees.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn merge_trees(
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/path_sum.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `has_path_sum`, `path_sum`, `dfs`, `path_sum_iii`, and `path_sum_iii_dfs` are never used
[INFO] [stdout]   --> src/binary_tree/path_sum.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     pub fn path_sum_iii(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn path_sum_iii_dfs(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/populating_next_right_pointers.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `connect` is never used
[INFO] [stdout]  --> src/binary_tree/populating_next_right_pointers.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn connect(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/prune_tree.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `prune_tree` is never used
[INFO] [stdout]  --> src/binary_tree/prune_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn prune_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/right_side_view.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `right_side_view` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/right_side_view.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, depth: usize, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Codec` is never constructed
[INFO] [stdout]  --> src/binary_tree/serialize_and_deserialize.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Codec {}
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `serialize`, `serialize_inner`, `deserialize`, and `deserialize_inner` are never used
[INFO] [stdout]   --> src/binary_tree/serialize_and_deserialize.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Codec {
[INFO] [stdout]    | ---------- associated items in this implementation
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn serialize(&self, root: Option<Rc<RefCell<TreeNode>>>) -> String {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn serialize_inner(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut String) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn deserialize(&self, data: String) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn deserialize_inner(data: &[u8], pos: &mut usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/sum_numbers.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sum_numbers`, `dfs`, `sum_numbers_clean`, and `dfs2` are never used
[INFO] [stdout]   --> src/binary_tree/sum_numbers.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn sum_numbers(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn dfs(root: Option<Rc<RefCell<TreeNode>>>, mut num: i32, ans: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn sum_numbers_clean(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn dfs2(root: Option<Rc<RefCell<TreeNode>>>, mut num: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/traversal.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `preorder_traversal`, `pre_dfs`, `inorder_traversal`, `in_dfs`, `postorder_traversal`, and `post_dfs` are never used
[INFO] [stdout]   --> src/binary_tree/traversal.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn pre_dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn in_dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn post_dfs(root: &Option<Rc<RefCell<TreeNode>>>, ans: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_tree/traversal.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `preorder_traversal`, `inorder_traversal`, and `postorder_traversal` are never used
[INFO] [stdout]    --> src/binary_tree/traversal.rs:62:12
[INFO] [stdout]     |
[INFO] [stdout]  61 | impl Solution2 {
[INFO] [stdout]     | -------------- associated functions in this implementation
[INFO] [stdout]  62 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  83 |     pub fn inorder_traversal(mut root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 101 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/width_of_binary_tree.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `width_of_binary_tree` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 11 |     pub fn width_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution1` is never constructed
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution1;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `width_of_binary_tree` is never used
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:48:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | impl Solution1 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 48 |     pub fn width_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/bag_combine/can_partition.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_partition` is never used
[INFO] [stdout]  --> src/dp/bag_combine/can_partition.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     // 
[INFO] [stdout] 8 |     pub fn can_partition(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `coin_change` is never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     //
[INFO] [stdout] 16 |     pub fn coin_change(mut coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MemoDFS1` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct MemoDFS1;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `change` and `dfs` are never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl MemoDFS1 {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 14 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn dfs(i: usize, nums: &[i32], amount: usize, memo: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `change` is never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 49 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `change` is never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:12
[INFO] [stdout]    |
[INFO] [stdout] 81 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 82 |     /// dp[i],凑成金额i的组合总数。
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MemoDFS2` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:90:8
[INFO] [stdout]    |
[INFO] [stdout] 90 | struct MemoDFS2;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `change` and `dfs` are never used
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:93:12
[INFO] [stdout]    |
[INFO] [stdout] 92 | impl MemoDFS2 {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 93 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 99 |     fn dfs(start: usize, nums: &[i32], amount: i32, memo: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/dp/bag_combine/permute_sum_iv.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `combination_sum4` is never used
[INFO] [stdout]   --> src/dp/bag_combine/permute_sum_iv.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     // [70. 爬楼梯] 问题的扩展，爬楼梯相当于nums是[1, 2]
[INFO] [stdout] 16 |     pub fn combination_sum4(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_ii.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iii.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iv.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/dp/buy_and_sell_stock_iv.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_profit(k: i32, prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/climb_stairs.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `climb_stairs` is never used
[INFO] [stdout]  --> src/dp/climb_stairs.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/edit_distance.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_distance` is never used
[INFO] [stdout]  --> src/dp/edit_distance.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn min_distance(s1: String, s2: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/interleave_string.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_interleave`, `dfs`, and `dp` are never used
[INFO] [stdout]   --> src/dp/interleave_string.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn is_interleave(s1: String, s2: String, s3: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     pub fn dp(s1: String, s2: String, s3: String) -> bool {
[INFO] [stdout]    |            ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/maximum_subarray.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sub_array` is never used
[INFO] [stdout]  --> src/dp/maximum_subarray.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/dp/maximum_subarray.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sub_array` is never used
[INFO] [stdout]   --> src/dp/maximum_subarray.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/dp/triangle.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_total` is never used
[INFO] [stdout]  --> src/dp/triangle.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn minimum_total(triangle: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/bipartite_graph.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_bipartite` is never used
[INFO] [stdout]  --> src/graph/bipartite_graph.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     // bfs 染色的同时判断是否冲突
[INFO] [stdout] 7 |     pub fn is_bipartite(graph: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_finish` is never used
[INFO] [stdout]  --> src/graph/course_schedule.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_finish` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule.rs:41:12
[INFO] [stdout]    |
[INFO] [stdout] 40 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 41 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61 |     fn dfs(node: usize, g: &Vec<Vec<usize>>, states: &mut [i32]) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `State` is never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:46:6
[INFO] [stdout]    |
[INFO] [stdout] 46 | enum State {
[INFO] [stdout]    |      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_order` and `dfs` are never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 52 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn dfs(node: usize, g: &[Vec<usize>], states: &mut [State], ans: &mut Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:93:8
[INFO] [stdout]    |
[INFO] [stdout] 93 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Edge` is never constructed
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:95:8
[INFO] [stdout]    |
[INFO] [stdout] 95 | struct Edge {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `EMPTY_EDGE` is never used
[INFO] [stdout]   --> src/graph/course_schedule_ii.rs:99:7
[INFO] [stdout]    |
[INFO] [stdout] 99 | const EMPTY_EDGE: usize = usize::MAX;
[INFO] [stdout]    |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]    --> src/graph/course_schedule_ii.rs:102:12
[INFO] [stdout]     |
[INFO] [stdout] 101 | impl Solution3 {
[INFO] [stdout]     | -------------- associated function in this implementation
[INFO] [stdout] 102 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/find_cheapest_price.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_cheapest_price` is never used
[INFO] [stdout]  --> src/graph/find_cheapest_price.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn find_cheapest_price(n: i32, flights: Vec<Vec<i32>>, src: i32, dst: i32, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/flood_fill.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flood_fill` and `dfs` are never used
[INFO] [stdout]   --> src/graph/flood_fill.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn flood_fill(image: Vec<Vec<i32>>, sr: i32, sc: i32, color: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(image: &mut Vec<Vec<i32>>, r: i32, c: i32, old_color: i32, new_color: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/flood_fill.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `flood_fill` is never used
[INFO] [stdout]   --> src/graph/flood_fill.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 31 |     /// bfs
[INFO] [stdout] 32 |     pub fn flood_fill(image: Vec<Vec<i32>>, sr: i32, sc: i32, color: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/max_area_of_island.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_area_of_island` and `dfs` are never used
[INFO] [stdout]   --> src/graph/max_area_of_island.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn max_area_of_island(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn dfs(grid: &mut Vec<Vec<i32>>, r: i32, c: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/max_area_of_island.rs:37:8
[INFO] [stdout]    |
[INFO] [stdout] 37 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_area_of_island` and `bfs` are never used
[INFO] [stdout]   --> src/graph/max_area_of_island.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 40 |     pub fn max_area_of_island(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn bfs(grid: &mut Vec<Vec<i32>>, r: i32, c: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/min_height_trees.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Edge` is never constructed
[INFO] [stdout]  --> src/graph/min_height_trees.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Edge {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/graph/min_height_trees.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Edge {
[INFO] [stdout]   | --------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn new(to: usize, next: usize) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `EMPTY_EDGE` is never used
[INFO] [stdout]   --> src/graph/min_height_trees.rs:13:7
[INFO] [stdout]    |
[INFO] [stdout] 13 | const EMPTY_EDGE: usize = usize::MAX;
[INFO] [stdout]    |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_height_trees` is never used
[INFO] [stdout]   --> src/graph/min_height_trees.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn find_min_height_trees(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/network_delay_time.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `network_delay_time` is never used
[INFO] [stdout]  --> src/graph/network_delay_time.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn network_delay_time(times: Vec<Vec<i32>>, n: i32, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Edge` is never constructed
[INFO] [stdout]   --> src/graph/network_delay_time.rs:51:8
[INFO] [stdout]    |
[INFO] [stdout] 51 | struct Edge {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `EMPTY_EDGE` is never used
[INFO] [stdout]   --> src/graph/network_delay_time.rs:56:7
[INFO] [stdout]    |
[INFO] [stdout] 56 | const EMPTY_EDGE: usize = usize::MAX;
[INFO] [stdout]    |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/network_delay_time.rs:57:8
[INFO] [stdout]    |
[INFO] [stdout] 57 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `network_delay_time` is never used
[INFO] [stdout]   --> src/graph/network_delay_time.rs:59:12
[INFO] [stdout]    |
[INFO] [stdout] 58 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 59 |     pub fn network_delay_time(times: Vec<Vec<i32>>, n: i32, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/num_islands.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `num_islands` and `dfs` are never used
[INFO] [stdout]   --> src/graph/num_islands.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn dfs(grid: &mut Vec<Vec<char>>, r: i32, c: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/num_islands.rs:37:8
[INFO] [stdout]    |
[INFO] [stdout] 37 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `num_islands` and `bfs` are never used
[INFO] [stdout]   --> src/graph/num_islands.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 40 |     pub fn num_islands(mut grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn bfs(grid: &mut Vec<Vec<char>>, r: i32, c: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/number_of_provinces.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_circle_num` and `find_id` are never used
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn find_id(mut node: usize, ids: &mut [usize]) -> usize {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_circle_num` and `dfs` are never used
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 42 |     pub fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn dfs(node: usize, is_connected: &[Vec<i32>], visited: &mut [bool]) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/pacific_atlantic.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `pacific_atlantic` and `dfs` are never used
[INFO] [stdout]   --> src/graph/pacific_atlantic.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn pacific_atlantic(heights: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn dfs(r: i32, c: i32, prev: i32, heights: &Vec<Vec<i32>>, visited: &mut Vec<Vec<bool>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/redundant_connection.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_redundant_connection` and `find` are never used
[INFO] [stdout]   --> src/graph/redundant_connection.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn find_redundant_connection(edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn find(mut val: usize, parents: &mut [usize]) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/rotting_oranges.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `oranges_rotting` is never used
[INFO] [stdout]  --> src/graph/rotting_oranges.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 7 |     pub fn oranges_rotting(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/shortest_path_binary_matrix.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `D` is never used
[INFO] [stdout]  --> src/graph/shortest_path_binary_matrix.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | const D: [(i32, i32); 8] = [
[INFO] [stdout]   |       ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `shortest_path_binary_matrix` is never used
[INFO] [stdout]   --> src/graph/shortest_path_binary_matrix.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     // bfs层序遍历
[INFO] [stdout] 18 |     pub fn shortest_path_binary_matrix(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/surrounded_regions.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `solve` and `dfs` are never used
[INFO] [stdout]   --> src/graph/surrounded_regions.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn solve(board: &mut Vec<Vec<char>>) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn dfs(board: &mut Vec<Vec<char>>, r: i32, c: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/update_matrix.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `update_matrix` and `bfs` are never used
[INFO] [stdout]   --> src/graph/update_matrix.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn update_matrix(mat: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn bfs(mat: &Vec<Vec<i32>>, r: usize, c: usize) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/graph/update_matrix.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `update_matrix` is never used
[INFO] [stdout]   --> src/graph/update_matrix.rs:54:12
[INFO] [stdout]    |
[INFO] [stdout] 53 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 54 |     pub fn update_matrix(mat: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/graph/word_search.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `exist` and `dfs` are never used
[INFO] [stdout]   --> src/graph/word_search.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn exist(board: Vec<Vec<char>>, mut word: String) -> bool {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/first_missing_positive.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `first_missing_positive` and `first_missing_positive2` are never used
[INFO] [stdout]   --> src/hash/first_missing_positive.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn first_missing_positive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     pub fn first_missing_positive2(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/happy_number.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_happy`, `is_happy2`, `is_happy3`, and `new_num` are never used
[INFO] [stdout]   --> src/hash/happy_number.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     /// 哈希表记录已经处理过的数
[INFO] [stdout]  7 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     pub fn is_happy2(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn is_happy3(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn new_num(mut n: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/is_anagram.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]  --> src/hash/is_anagram.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     /// 使用栈上固定大小的数组记录字符频次，相比堆上哈希表性能高很多。
[INFO] [stdout] 6 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/isomorphic_strings.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]  --> src/hash/isomorphic_strings.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn is_isomorphic(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RandomizedSet` is never constructed
[INFO] [stdout]  --> src/hash/randomized_set.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct RandomizedSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stdout]   --> src/hash/randomized_set.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl RandomizedSet {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 11 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn get_random(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/ransom_note.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_construct1`, `can_construct2`, and `can_construct3` are never used
[INFO] [stdout]   --> src/hash/ransom_note.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn can_construct1(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     pub fn can_construct2(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     pub fn can_construct3(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/hash/word_pattern.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_pattern` is never used
[INFO] [stdout]  --> src/hash/word_pattern.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 9 |     pub fn word_pattern(pattern: String, s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/k_closest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `k_closest`, `k_closest2`, and `k_closest3` are never used
[INFO] [stdout]   --> src/heap/k_closest.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn k_closest2(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn k_closest3(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/k_closest_elements.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_closest_elements` and `find_closest_elements2` are never used
[INFO] [stdout]   --> src/heap/k_closest_elements.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn find_closest_elements2(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/kth_largest.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_kth_largest` is never used
[INFO] [stdout]  --> src/heap/kth_largest.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     // 小顶堆
[INFO] [stdout] 9 |     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/heap/top_k_frequent_word.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `WordItem` is never constructed
[INFO] [stdout]  --> src/heap/top_k_frequent_word.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct WordItem {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `top_k_frequent` is never used
[INFO] [stdout]   --> src/heap/top_k_frequent_word.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn top_k_frequent(words: Vec<String>, k: i32) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/add_two_numbers.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `add_two_numbers`, `add_two`, `add_two_numbers_iter`, and `add_two_numbers_bigendian` are never used
[INFO] [stdout]   --> src/linkedlist/add_two_numbers.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn add_two(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     pub fn add_two_numbers_iter(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     pub fn add_two_numbers_bigendian(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/insertion_sort_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insertion_sort_list` is never used
[INFO] [stdout]  --> src/linkedlist/insertion_sort_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn insertion_sort_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/linkedlist/insertion_sort_list.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insertion_sort_list` is never used
[INFO] [stdout]   --> src/linkedlist/insertion_sort_list.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn insertion_sort_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/linked_list_cycle.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `has_cycle` and `has_cycle2` are never used
[INFO] [stdout]   --> src/linkedlist/linked_list_cycle.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn has_cycle(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn has_cycle2(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LRUCache` is never constructed
[INFO] [stdout]  --> src/linkedlist/lru_cache.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct LRUCache {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/linkedlist/lru_cache.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get`, `put`, `append_to_head`, `remove_node`, and `move_to_head` are never used
[INFO] [stdout]   --> src/linkedlist/lru_cache.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl LRUCache {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 18 |     pub fn new(cap: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     pub fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 71 |     fn append_to_head(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 79 |     fn remove_node(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86 |     fn move_to_head(&mut self, idx: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/merge_k_lists.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge_k_lists`, `merge`, and `merge_two_lists` are never used
[INFO] [stdout]   --> src/linkedlist/merge_k_lists.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn merge_k_lists(mut lists: Vec<Option<Box<ListNode>>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn merge(lists: &mut [Option<Box<ListNode>>]) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn merge_two_lists(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/merge_two_sorted_lists.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `merge_two_lists`, `merge_two_lists_iter`, and `merge_two_lists_iter1` are never used
[INFO] [stdout]   --> src/linkedlist/merge_two_sorted_lists.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn merge_two_lists_iter(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     pub fn merge_two_lists_iter1(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/middle_of_the_linked_list.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `middle_node` is never used
[INFO] [stdout]  --> src/linkedlist/middle_of_the_linked_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn middle_node(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/odd_even_list.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `odd_even_list` is never used
[INFO] [stdout]  --> src/linkedlist/odd_even_list.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn odd_even_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/palindrome_linked_list.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/linkedlist/palindrome_linked_list.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn is_palindrome(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/partition_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `partition` is never used
[INFO] [stdout]  --> src/linkedlist/partition_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn partition(head: Option<Box<ListNode>>, x: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/remove_nth_from_end.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]  --> src/linkedlist/remove_nth_from_end.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/reorder_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reorder_list` is never used
[INFO] [stdout]  --> src/linkedlist/reorder_list.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn reorder_list(head: &mut Option<Box<ListNode>>) {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/reverse_k_group.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_k_group` and `reverse_list` are never used
[INFO] [stdout]   --> src/linkedlist/reverse_k_group.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  7 |     pub fn reverse_k_group(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn reverse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/reverse_linked_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse_between`, `reverse_list`, `reverse_list_recursive`, and `recursive` are never used
[INFO] [stdout]   --> src/linkedlist/reverse_linked_list.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     /// [92. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/description/)
[INFO] [stdout]  7 |     pub fn reverse_between(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     pub fn reverse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     pub fn reverse_list_recursive(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 58 |     fn recursive(prev: Option<Box<ListNode>>, cur: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/rotate_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rotate_right` and `node_count` are never used
[INFO] [stdout]   --> src/linkedlist/rotate_list.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn rotate_right(mut head: Option<Box<ListNode>>, mut k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn node_count(head: &Option<Box<ListNode>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/sort_list.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sort_list` and `merge` are never used
[INFO] [stdout]   --> src/linkedlist/sort_list.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn sort_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn merge(
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/linkedlist/swap_pairs.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `swap_pairs` is never used
[INFO] [stdout]  --> src/linkedlist/swap_pairs.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/find_duplicate.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_duplicate` is never used
[INFO] [stdout]  --> src/math/find_duplicate.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     // 环状链表寻找环入口
[INFO] [stdout] 8 |     pub fn find_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/palindrome_number.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/math/palindrome_number.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/math/palindrome_number.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]   --> src/math/palindrome_number.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/math/palindrome_number.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]   --> src/math/palindrome_number.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 40 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/power_of_two.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_two` is never used
[INFO] [stdout]  --> src/math/power_of_two.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn is_power_of_two(mut n: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/math/power_of_two.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_power_of_two` is never used
[INFO] [stdout]   --> src/math/power_of_two.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn is_power_of_two(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/task_scheduler.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `least_interval` is never used
[INFO] [stdout]  --> src/math/task_scheduler.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn least_interval(tasks: Vec<char>, n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/math/ugly_number.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `nth_ugly_number` is never used
[INFO] [stdout]  --> src/math/ugly_number.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn nth_ugly_number(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/asteroid_collision.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `asteroid_collision` is never used
[INFO] [stdout]  --> src/stack/asteroid_collision.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn asteroid_collision(asteroids: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/backspace_compare.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `backspace_compare` and `clean_datas` are never used
[INFO] [stdout]   --> src/stack/backspace_compare.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 12 |     fn clean_datas(datas: &[u8]) -> Vec<u8> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/stack/backspace_compare.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `backspace_compare` and `back_scan` are never used
[INFO] [stdout]   --> src/stack/backspace_compare.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn back_scan(bytes: &[u8], mut pos: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/basic_calculator.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `calculate`, `calc`, and `priority` are never used
[INFO] [stdout]   --> src/stack/basic_calculator.rs:8:12
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  8 |     pub fn calculate(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 63 |     fn calc(ops: &mut Vec<u8>, nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn priority(op: u8) -> (i32, i32) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/daily_temperatures.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `daily_temperatures` is never used
[INFO] [stdout]  --> src/stack/daily_temperatures.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/decode_string.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `decode_string` is never used
[INFO] [stdout]  --> src/stack/decode_string.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn decode_string(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/eval_rpn.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `eval_rpn` is never used
[INFO] [stdout]  --> src/stack/eval_rpn.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/stack/min_stack.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/stack/min_stack.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout]  7 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyQueue` is never constructed
[INFO] [stdout]  --> src/stack/my_queue.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct MyQueue {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used
[INFO] [stdout]   --> src/stack/my_queue.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl MyQueue {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout]  8 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn peek(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/stack/valid_parentheses.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid` and `is_valid2` are never used
[INFO] [stdout]   --> src/stack/valid_parentheses.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn is_valid2(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/character_replacement.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `character_replacement` and `check` are never used
[INFO] [stdout]   --> src/string/character_replacement.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn character_replacement(s: String, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn check(cnt: &[i32; 26], k: i32, total: i32) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling rust_dsa v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/find_anagrams.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_anagrams` is never used
[INFO] [stdout]  --> src/string/find_anagrams.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn find_anagrams(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/group_anagrams.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]  --> src/string/group_anagrams.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/string/group_anagrams.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]   --> src/string/group_anagrams.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/length_of_longest_substring.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `length_of_longest_substring` and `length_of_longest_substring2` are never used
[INFO] [stdout]   --> src/string/length_of_longest_substring.rs:7:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     /// 通过哈希表记录是否已经存在，如果存在，需要从左边界开始一个一个的迭代删除。
[INFO] [stdout]  7 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn length_of_longest_substring2(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/longest_common_prefix.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/string/longest_common_prefix.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn longest_common_prefix(mut strs: Vec<String>) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/min_window.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_window`, `contains`, and `min_window2` are never used
[INFO] [stdout]   --> src/string/min_window.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     // 对比两个哈希中的每一项来判断是否覆盖
[INFO] [stdout]  6 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn contains(s: &[i32; 60], t: &[i32; 60]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61 |     pub fn min_window2(s: String, t: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/is_palindrome.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_palindrome` and `is_palindrome_iter` are never used
[INFO] [stdout]   --> src/string/palindrome/is_palindrome.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn is_palindrome_iter(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/longest_palindrome.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `longest_palindrome`, `longest_palindrome_substring`, and `check_palindrome` are never used
[INFO] [stdout]   --> src/string/palindrome/longest_palindrome.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn longest_palindrome(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn longest_palindrome_substring(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn check_palindrome(s: &[u8], mut left: usize, mut right: usize) -> (usize, usize, usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/palindromic_substrings.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_substrings`, `count_substrings2`, and `calc` are never used
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     /// 中心扩散法
[INFO] [stdout]  6 |     pub fn count_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     pub fn count_substrings2(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn calc(s_bytes: &[u8], mut i: usize, mut j: usize) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:41:8
[INFO] [stdout]    |
[INFO] [stdout] 41 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_substrings` is never used
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 44 |     pub fn count_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/string/palindrome/valid_palindrome.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `valid_palindrome` and `is_palindrome` are never used
[INFO] [stdout]   --> src/string/palindrome/valid_palindrome.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn valid_palindrome(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn is_palindrome(s: &[u8]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/trie/word_break.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_break` is never used
[INFO] [stdout]  --> src/trie/word_break.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/trie/word_break.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_break` is never used
[INFO] [stdout]   --> src/trie/word_break.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 26 |     pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `remove_duplicatesII` should have a snake case name
[INFO] [stdout]   --> src/array/move_zeroes.rs:47:12
[INFO] [stdout]    |
[INFO] [stdout] 47 |     pub fn remove_duplicatesII(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `remove_duplicates_ii`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `LIS` should have a snake case name
[INFO] [stdout]  --> src/binary_search/mod.rs:1:9
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub mod LIS;
[INFO] [stdout]   |         ^^^ help: convert the identifier to snake case: `lis`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `isBadVersion` should have a snake case name
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^ help: convert the identifier to snake case: `is_bad_version`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: comparison is useless due to type limits
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:25:15
[INFO] [stdout]    |
[INFO] [stdout] 25 |         while i >= 0 && j < s_bytes.len() {
[INFO] [stdout]    |               ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_comparisons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/container_with_most_water.rs:27:9
[INFO] [stdout]    |
[INFO] [stdout] 27 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/contiguous_array.rs:23:9
[INFO] [stdout]    |
[INFO] [stdout] 23 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/gas_station.rs:27:9
[INFO] [stdout]    |
[INFO] [stdout] 27 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/interval/find_min_arrow_shots.rs:50:9
[INFO] [stdout]    |
[INFO] [stdout] 50 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/interval/non_overlap_intervals.rs:25:9
[INFO] [stdout]    |
[INFO] [stdout] 25 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/longest_consecutive.rs:32:9
[INFO] [stdout]    |
[INFO] [stdout] 32 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/rotate_array.rs:44:9
[INFO] [stdout]    |
[INFO] [stdout] 44 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/sort/sort_colors.rs:31:9
[INFO] [stdout]    |
[INFO] [stdout] 31 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/array/subarray_sum_equals_k.rs:23:9
[INFO] [stdout]    |
[INFO] [stdout] 23 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:96:9
[INFO] [stdout]    |
[INFO] [stdout] 96 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:76:9
[INFO] [stdout]    |
[INFO] [stdout] 76 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:63:9
[INFO] [stdout]    |
[INFO] [stdout] 63 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:51:9
[INFO] [stdout]    |
[INFO] [stdout] 51 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:83:9
[INFO] [stdout]    |
[INFO] [stdout] 83 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations_ii.rs:31:9
[INFO] [stdout]    |
[INFO] [stdout] 31 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:57:9
[INFO] [stdout]    |
[INFO] [stdout] 57 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_search/LIS.rs:44:9
[INFO] [stdout]    |
[INFO] [stdout] 44 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_search/find_peak_element.rs:39:9
[INFO] [stdout]    |
[INFO] [stdout] 39 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:28:9
[INFO] [stdout]    |
[INFO] [stdout] 28 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::BinaryHeap`
[INFO] [stdout]  --> src/binary_search/k_closest_elements.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use std::collections::BinaryHeap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:68:9
[INFO] [stdout]    |
[INFO] [stdout] 68 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_search/russian_doll_envelopes.rs:52:9
[INFO] [stdout]    |
[INFO] [stdout] 52 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_search/search_matrix.rs:32:9
[INFO] [stdout]    |
[INFO] [stdout] 32 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:45:9
[INFO] [stdout]    |
[INFO] [stdout] 45 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:46:9
[INFO] [stdout]    |
[INFO] [stdout] 46 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/minimum_difference.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/minimum_difference.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:53:9
[INFO] [stdout]    |
[INFO] [stdout] 53 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/search_in_bst.rs:54:9
[INFO] [stdout]    |
[INFO] [stdout] 54 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/distance_k_in_tree.rs:70:9
[INFO] [stdout]    |
[INFO] [stdout] 70 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/distance_k_in_tree.rs:71:9
[INFO] [stdout]    |
[INFO] [stdout] 71 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/binary_tree/flatten_to_linked_list.rs:144:9
[INFO] [stdout]     |
[INFO] [stdout] 144 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]    --> src/binary_tree/flatten_to_linked_list.rs:145:9
[INFO] [stdout]     |
[INFO] [stdout] 145 |     use crate::tree;
[INFO] [stdout]     |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `is_same_tree`
[INFO] [stdout]  --> src/binary_tree/is_same_tree.rs:1:36
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{TreeNode, is_same_tree};
[INFO] [stdout]   |                                    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/binary_tree/is_symmetric.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::borrow`
[INFO] [stdout]  --> src/binary_tree/level_order/zigzag_level_order.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/max_path_sum.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/max_path_sum.rs:31:9
[INFO] [stdout]    |
[INFO] [stdout] 31 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/populating_next_right_pointers.rs:16:9
[INFO] [stdout]    |
[INFO] [stdout] 16 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/populating_next_right_pointers.rs:17:9
[INFO] [stdout]    |
[INFO] [stdout] 17 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/right_side_view.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/right_side_view.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/binary_tree/traversal.rs:127:9
[INFO] [stdout]     |
[INFO] [stdout] 127 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]    --> src/binary_tree/traversal.rs:128:9
[INFO] [stdout]     |
[INFO] [stdout] 128 |     use crate::tree;
[INFO] [stdout]     |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/binary_tree/width_of_binary_tree.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:94:9
[INFO] [stdout]    |
[INFO] [stdout] 94 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::tree`
[INFO] [stdout]   --> src/binary_tree/width_of_binary_tree.rs:95:9
[INFO] [stdout]    |
[INFO] [stdout] 95 |     use crate::tree;
[INFO] [stdout]    |         ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/dp/bag_combine/coin_change.rs:43:9
[INFO] [stdout]    |
[INFO] [stdout] 43 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/dp/bag_combine/coin_change_ii.rs:125:9
[INFO] [stdout]     |
[INFO] [stdout] 125 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/dp/bag_combine/permute_sum_iv.rs:36:9
[INFO] [stdout]    |
[INFO] [stdout] 36 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/dp/climb_stairs.rs:16:9
[INFO] [stdout]    |
[INFO] [stdout] 16 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/dp/maximum_subarray.rs:34:9
[INFO] [stdout]    |
[INFO] [stdout] 34 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/bipartite_graph.rs:40:9
[INFO] [stdout]    |
[INFO] [stdout] 40 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `Visited` and `Visiting`
[INFO] [stdout]  --> src/graph/course_schedule_ii.rs:5:47
[INFO] [stdout]   |
[INFO] [stdout] 5 | use crate::graph::course_schedule_ii::State::{Visited, Visiting};
[INFO] [stdout]   |                                               ^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/graph/course_schedule_ii.rs:146:9
[INFO] [stdout]     |
[INFO] [stdout] 146 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/find_cheapest_price.rs:35:9
[INFO] [stdout]    |
[INFO] [stdout] 35 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/max_area_of_island.rs:81:9
[INFO] [stdout]    |
[INFO] [stdout] 81 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/min_height_trees.rs:71:9
[INFO] [stdout]    |
[INFO] [stdout] 71 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/graph/network_delay_time.rs:116:9
[INFO] [stdout]     |
[INFO] [stdout] 116 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/num_islands.rs:77:9
[INFO] [stdout]    |
[INFO] [stdout] 77 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/number_of_provinces.rs:67:9
[INFO] [stdout]    |
[INFO] [stdout] 67 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/pacific_atlantic.rs:55:9
[INFO] [stdout]    |
[INFO] [stdout] 55 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/redundant_connection.rs:32:9
[INFO] [stdout]    |
[INFO] [stdout] 32 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/rotting_oranges.rs:47:9
[INFO] [stdout]    |
[INFO] [stdout] 47 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/shortest_path_binary_matrix.rs:58:9
[INFO] [stdout]    |
[INFO] [stdout] 58 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/surrounded_regions.rs:45:9
[INFO] [stdout]    |
[INFO] [stdout] 45 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/update_matrix.rs:89:9
[INFO] [stdout]    |
[INFO] [stdout] 89 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/graph/word_search.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/hash/isomorphic_strings.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/linkedlist/insertion_sort_list.rs:57:9
[INFO] [stdout]    |
[INFO] [stdout] 57 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/linkedlist/merge_k_lists.rs:51:9
[INFO] [stdout]    |
[INFO] [stdout] 51 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::DerefMut`
[INFO] [stdout]  --> src/linkedlist/middle_of_the_linked_list.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::DerefMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/linkedlist/reverse_k_group.rs:56:9
[INFO] [stdout]    |
[INFO] [stdout] 56 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `graph::node`
[INFO] [stdout]  --> src/linkedlist/rotate_list.rs:1:13
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::{graph::node, linkedlist::ListNode};
[INFO] [stdout]   |             ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/linkedlist/rotate_list.rs:50:9
[INFO] [stdout]    |
[INFO] [stdout] 50 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/math/find_duplicate.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/math/palindrome_number.rs:61:9
[INFO] [stdout]    |
[INFO] [stdout] 61 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/math/power_of_two.rs:31:9
[INFO] [stdout]    |
[INFO] [stdout] 31 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/math/ugly_number.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::stack`
[INFO] [stdout]  --> src/stack/asteroid_collision.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::stack;
[INFO] [stdout]   |     ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/stack/asteroid_collision.rs:42:9
[INFO] [stdout]    |
[INFO] [stdout] 42 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/stack/backspace_compare.rs:73:9
[INFO] [stdout]    |
[INFO] [stdout] 73 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/stack/daily_temperatures.rs:27:9
[INFO] [stdout]    |
[INFO] [stdout] 27 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/stack/decode_string.rs:38:9
[INFO] [stdout]    |
[INFO] [stdout] 38 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/stack/eval_rpn.rs:36:9
[INFO] [stdout]    |
[INFO] [stdout] 36 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/string/character_replacement.rs:43:9
[INFO] [stdout]    |
[INFO] [stdout] 43 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/string/find_anagrams.rs:40:9
[INFO] [stdout]    |
[INFO] [stdout] 40 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/string/group_anagrams.rs:43:9
[INFO] [stdout]    |
[INFO] [stdout] 43 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/string/palindrome/palindromic_substrings.rs:69:9
[INFO] [stdout]    |
[INFO] [stdout] 69 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/trie/word_break.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/longest_consecutive.rs:10:13
[INFO] [stdout]    |
[INFO] [stdout] 10 |         let mut set = nums.into_iter().collect::<HashSet<i32>>();
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/majority_element.rs:10:34
[INFO] [stdout]    |
[INFO] [stdout] 10 |     pub fn majority_element_vote(mut nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                  ----^^^^
[INFO] [stdout]    |                                  |
[INFO] [stdout]    |                                  help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/array/rotate_array.rs:5:40
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]   |                                        ----^
[INFO] [stdout]   |                                        |
[INFO] [stdout]   |                                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/array/rotate_array.rs:29:40
[INFO] [stdout]    |
[INFO] [stdout] 29 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |                                        ----^
[INFO] [stdout]    |                                        |
[INFO] [stdout]    |                                        help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:49:9
[INFO] [stdout]    |
[INFO] [stdout] 49 |         mut start: usize,
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `version`
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:21:28
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |                            ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_version`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree/flatten_to_linked_list.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut dummy = Rc::new(RefCell::new(TreeNode::new(0)));
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree/sum_numbers.rs:13:13
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut num = 0;
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:14:32
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ----^^^^^
[INFO] [stdout]    |                                |
[INFO] [stdout]    |                                help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:49:32
[INFO] [stdout]    |
[INFO] [stdout] 49 |     pub fn change(amount: i32, mut coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ----^^^^^
[INFO] [stdout]    |                                |
[INFO] [stdout]    |                                help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `amount`
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:19
[INFO] [stdout]    |
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                   ^^^^^^ help: if this is intentional, prefix it with an underscore: `_amount`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `coins`
[INFO] [stdout]   --> src/dp/bag_combine/coin_change_ii.rs:83:32
[INFO] [stdout]    |
[INFO] [stdout] 83 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]    |                                ^^^^^ help: if this is intentional, prefix it with an underscore: `_coins`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/graph/redundant_connection.rs:21:13
[INFO] [stdout]    |
[INFO] [stdout] 21 |     fn find(mut val: usize, parents: &mut [usize]) -> usize {
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/graph/update_matrix.rs:59:21
[INFO] [stdout]    |
[INFO] [stdout] 59 |             for (c, val) in row.iter().enumerate() {
[INFO] [stdout]    |                     ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/graph/word_search.rs:5:41
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn exist(board: Vec<Vec<char>>, mut word: String) -> bool {
[INFO] [stdout]   |                                         ----^^^^
[INFO] [stdout]   |                                         |
[INFO] [stdout]   |                                         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/hash/happy_number.rs:7:21
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn is_happy(mut n: i32) -> bool {
[INFO] [stdout]   |                     ----^
[INFO] [stdout]   |                     |
[INFO] [stdout]   |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/linkedlist/linked_list_cycle.rs:7:22
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn has_cycle(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |                      ----^^^^
[INFO] [stdout]   |                      |
[INFO] [stdout]   |                      help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/linkedlist/linked_list_cycle.rs:29:23
[INFO] [stdout]    |
[INFO] [stdout] 29 |     pub fn has_cycle2(mut head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |                       ----^^^^
[INFO] [stdout]    |                       |
[INFO] [stdout]    |                       help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/linkedlist/odd_even_list.rs:7:26
[INFO] [stdout]   |
[INFO] [stdout] 7 |     pub fn odd_even_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |                          ----^^^^
[INFO] [stdout]   |                          |
[INFO] [stdout]   |                          help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/math/palindrome_number.rs:40:26
[INFO] [stdout]    |
[INFO] [stdout] 40 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]    |                          ----^
[INFO] [stdout]    |                          |
[INFO] [stdout]    |                          help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/container_with_most_water.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_area` is never used
[INFO] [stdout]  --> src/array/container_with_most_water.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn max_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/contiguous_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_max_length` is never used
[INFO] [stdout]  --> src/array/contiguous_array.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn find_max_length(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/gas_station.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_complete_circuit` is never used
[INFO] [stdout]  --> src/array/gas_station.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/find_min_arrow_shots.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]  --> src/array/interval/find_min_arrow_shots.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     // 左边界排序
[INFO] [stdout] 6 |     pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/array/interval/find_min_arrow_shots.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]   --> src/array/interval/find_min_arrow_shots.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 30 |     // 右边界排序
[INFO] [stdout] 31 |     pub fn find_min_arrow_shots(mut points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/interval/non_overlap_intervals.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `erase_overlap_intervals` is never used
[INFO] [stdout]  --> src/array/interval/non_overlap_intervals.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn erase_overlap_intervals(mut intervals: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/longest_consecutive.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]  --> src/array/longest_consecutive.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/rotate_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `rotate` and `reverse` are never used
[INFO] [stdout]   --> src/array/rotate_array.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn reverse(nums: &mut [i32], mut start: usize, mut end: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/array/rotate_array.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]   --> src/array/rotate_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn rotate(nums: &mut Vec<i32>, mut k: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/sort/sort_colors.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort_colors` is never used
[INFO] [stdout]  --> src/array/sort/sort_colors.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn sort_colors(nums: &mut Vec<i32>) {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/array/subarray_sum_equals_k.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `subarray_sum` is never used
[INFO] [stdout]  --> src/array/subarray_sum_equals_k.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/letter_combinations.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DICT` is never used
[INFO] [stdout]  --> src/backtrack/letter_combinations.rs:7:7
[INFO] [stdout]   |
[INFO] [stdout] 7 | const DICT: &[&[char]; 8] = &[
[INFO] [stdout]   |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 19 |     //
[INFO] [stdout] 20 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn dfs(i: usize, digits: &[usize], path: &mut String, ans: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MAP` is never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:52:7
[INFO] [stdout]    |
[INFO] [stdout] 52 | const MAP: &[&[u8]] = &[
[INFO] [stdout]    |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/letter_combinations.rs:58:12
[INFO] [stdout]    |
[INFO] [stdout] 56 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 57 |     //
[INFO] [stdout] 58 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn dfs(i: usize, digits: &[usize], path: &mut [u8], ans: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum_ii.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn combination_sum2(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn dfs(mut i: usize, target: i32, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_ii.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 37 |     // 对答案中的每一个位置，都枚举所有可能填入的数字
[INFO] [stdout] 38 |     pub fn combination_sum2(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combination_sum_iii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum3` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     //
[INFO] [stdout]  6 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(num: i32, target: i32, k: usize, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum3` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combination_sum_iii.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 35 |     //
[INFO] [stdout] 36 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn dfs(start: i32, target: i32, pos: usize, path: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/combine_n_k.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn dfs(i: i32, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, n: i32, left: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/combine_n_k.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 29 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn dfs(start: i32, path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, n: i32, left: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/permutations.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn dfs(nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, used: &mut Vec<bool>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 35 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn dfs(nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>, used_mask: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 59 | impl Solution3 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 60 |     pub fn permute(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn dfs(start: usize, nums: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/permutations_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute_unique` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/permutations_ii.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn permute_unique(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn dfs(start: usize, nums: &mut [i32], ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/subsets.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(i: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 28 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn dfs(start: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/backtrack/permute_combination/subsets_ii.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets_with_dup` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn dfs(start: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets_with_dup` and `dfs` are never used
[INFO] [stdout]   --> src/backtrack/permute_combination/subsets_ii.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution2 {
[INFO] [stdout]    | -------------- associated functions in this implementation
[INFO] [stdout] 30 |     pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn dfs(mut i: usize, nums: &[i32], path: &mut Vec<i32>, ans: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/LIS.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `length_of_lis` and `lower_bound` are never used
[INFO] [stdout]   --> src/binary_search/LIS.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn lower_bound(nums: &[i32], x: i32) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_peak_element` is never used
[INFO] [stdout]  --> src/binary_search/find_peak_element.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/first_bad_version.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `first_bad_version` and `isBadVersion` are never used
[INFO] [stdout]   --> src/binary_search/first_bad_version.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- methods in this implementation
[INFO] [stdout]  5 |     pub fn first_bad_version(&self, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn isBadVersion(&self, version: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/mountain_array.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]  --> src/binary_search/mountain_array.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution2` is never constructed
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | struct Solution2;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution2 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | struct Solution3;
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]   --> src/binary_search/mountain_array.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 49 |     pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/russian_doll_envelopes.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_envelopes` and `lower_bound` are never used
[INFO] [stdout]   --> src/binary_search/russian_doll_envelopes.rs:5:12
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  5 |     pub fn max_envelopes(mut envelopes: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn lower_bound(nums: &[i32], x: i32) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_search/search_matrix.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix` is never used
[INFO] [stdout]  --> src/binary_search/search_matrix.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_bound2` is never used
[INFO] [stdout]   --> src/binary_search/search_range.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout]  4 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 49 |     fn search_bound2(nums: &[i32], target: i32, is_lower: bool) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TimeMap` is never constructed
[INFO] [stdout]  --> src/binary_search/time_map.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct TimeMap {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set`, `get`, and `search_upper` are never used
[INFO] [stdout]   --> src/binary_search/time_map.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl TimeMap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn set(&mut self, key: String, value: String, timestamp: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn get(&self, key: String, timestamp: i32) -> String {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn search_upper(values: &[(i32, String)], target_time: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/lowest_common_ancestor.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/minimum_difference.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_minimum_difference` and `dfs` are never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/minimum_difference.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, prev: &mut i32, ans: &mut i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/binary_tree/binary_search_tree/my_calendar_i.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Node {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/binary_tree/binary_search_tree/my_calendar_i.rs:11:8
[INFO] [stdout]    |
[WARN] too many lines in the log, truncating it
